Single machine batch scheduling with release times and delivery costs

2011 ◽  
Vol 16 (1) ◽  
pp. 69-79 ◽  
Author(s):  
Esaignani Selvarajah ◽  
George Steiner ◽  
Rui Zhang
Keyword(s):  
Single Machine ◽  
Batch Scheduling ◽  
Release Times ◽  
Delivery Costs

scholarly journals Single-machine batch scheduling minimizing weighted flow times and delivery costs with job release times

2012 ◽  
Vol 3 (3) ◽  
pp. 347-364 ◽  
Author(s):  
Mohammad Mahdavi Mazdeh ◽  
Ali Naji Esfahani ◽  
Seyed Ershad Sakkaki ◽  
Amir Ebrahimzadeh Pilerood
Keyword(s):  
Single Machine ◽  
Batch Scheduling ◽  
Release Times ◽  
Delivery Costs

scholarly journals Single machine batch scheduling with release times

2007 ◽  
Vol 17 (3) ◽  
pp. 323-338 ◽  
Author(s):  
Beat Gfeller ◽  
Leon Peeters ◽  
Birgitta Weber ◽  
Peter Widmayer
Keyword(s):  
Single Machine ◽  
Batch Scheduling ◽  
Release Times

scholarly journals Batch Scheduling on a Single Machine with Maintenance Interval

2020 ◽  
Author(s):  
Zhang Honglin ◽  
Bin Qian ◽  
Yaohua Wu
Keyword(s):  
Dynamic Programming ◽  
Single Machine ◽  
Manufacturing Industry ◽  
Dynamic Programming Algorithm ◽  
Batch Scheduling ◽  
Programming Algorithm ◽  
Small Scale ◽  
Field Representation ◽  
Machine Failure ◽  
Delivery Costs

In the manufacturing industry, orders are typically scheduled and delivered through batches, and the probability of machine failure under high-load operation is high. On this basis, we focus on a single machine batch scheduling problem with a maintenance interval (SMBSP-MI). The studied problem is expressed by three-field representation as 1|B,MI|\sum{F_j+\mu}m, and the optimization objective is to minimize total flow time and delivery costs. Firstly, 1|B,MI|\sum{F_j+\mu}m is proved to be NP-hard by Turing reduction. Secondly, shortest processing time (SPT) order is shown the optimal scheduling of SMBSP-MI, and a dynamic programming algorithm based on SPT (DPA-SPT) with the time complexity of O(n^3T_1) is proposed. A small-scale example is designed to verify the feasibility of DPA-SPT. Finally, DPA-SPT is approximated to a fully-polynomial dynamic programming approximation algorithm based on SPT (FDPAA-SPT) by intervals partitioning technique. The proposed FDPAA-SPT runs in O(\frac{n^5}{\varepsilon^2})\ time with the approximation (1+\varepsilon).

scholarly journals Single-machine batch scheduling minimizing weighted flow times and delivery costs

2011 ◽  
Vol 35 (1) ◽  
pp. 563-570 ◽  
Author(s):  
Mohammad Mahdavi Mazdeh ◽  
Sara Shashaani ◽  
Armin Ashouri ◽  
Khalil S. Hindi
Keyword(s):  
Single Machine ◽  
Batch Scheduling ◽  
Delivery Costs
Sign in / Sign up

Export Citation Format

Share Document