Online Single Machine Batch Scheduling

Author(s):  
Beat Gfeller ◽  
Leon Peeters ◽  
Birgitta Weber ◽  
Peter Widmayer
2011 ◽  
Vol 16 (1) ◽  
pp. 69-79 ◽  
Author(s):  
Esaignani Selvarajah ◽  
George Steiner ◽  
Rui Zhang

2016 ◽  
Vol 50 (4-5) ◽  
pp. 715-732 ◽  
Author(s):  
Junheng Cheng ◽  
Feng Chu ◽  
Chengbin Chu ◽  
Weili Xia

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 258
Author(s):  
Miaomiao Jin ◽  
Xiaoxia Liu ◽  
Wenchang Luo

We investigate the single-machine parallel-batch scheduling problem with nonidentical job sizes and rejection. In this problem, a set of jobs with different processing times and nonidentical sizes is given to be possibly processed on a parallel-batch processing machine. Each job is either accepted and then processed on the machine or rejected by paying its rejection penalty. Preemption is not allowed. Our task is to choose the accepted jobs and schedule them as batches on the machine to minimize the makespan of the accepted jobs plus the total rejection penalty of the rejected jobs. We provide an integer programming formulation to exactly solve our problem. Then, we propose three fast heuristic algorithms to solve the problem and evaluate their performances by using a small numerical example.


Sign in / Sign up

Export Citation Format

Share Document