Minimizing Makespan in Batch Machine Scheduling

2000 ◽  
pp. 386-397
Author(s):  
Chung Keung Poon ◽  
Pixing Zhang
Keyword(s):  
Machine Scheduling ◽  
Batch Machine

ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING

2004 ◽  
Vol 15 (04) ◽  
pp. 593-607 ◽  
Author(s):  
CHUNG KEUNG POON ◽  
WENCI YU
Keyword(s):  
Completion Time ◽  
Machine Scheduling ◽  
Total Completion Time ◽  
Scheduling Problem ◽  
Running Time ◽  
Batch Machine ◽  
Previous Time

We study the scheduling problem on a batch machine which is capable of processing a batch of jobs at a time. For a batch machine of capacity c, we designed an algorithm for minimizing the total completion time in O(n6c) time (for sufficiently large c). This improves the best previous time bound of O(nc(c-1)) given by Brucker et al [1]. We also designed a new algorithm with running time [Formula: see text].

Minimizing Makespan in Batch Machine Scheduling

Algorithmica ◽  
2004 ◽  
Vol 39 (2) ◽  
pp. 155-174 ◽  
Author(s):  
Chung Keung Poon ◽  
Pixing Zhang
Keyword(s):  
Machine Scheduling ◽  
Batch Machine

Single batch machine scheduling with deliveries

2015 ◽  
Vol 62 (6) ◽  
pp. 470-482 ◽  
Author(s):  
B.-Y. Cheng ◽  
J.Y.-T. Leung ◽  
K. Li ◽  
S.-L. Yang
Keyword(s):  
Machine Scheduling ◽  
Batch Machine ◽  
Single Batch
Sign in / Sign up

Export Citation Format

Share Document