Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan

• Published in: Central European journal of operations research Vol. 21; no. 1; pp. 177 - 186
• Main Authors: He, Cheng, Lin, Hao, Lin, Yixun, Tian, Ji
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer-Verlag 01.01.2013; Springer; Springer Nature B.V
• Subjects: Algorithms; Analysis; Batch processing; Business and Management; Employment; Methods; Operations research; Operations Research/Decision Theory; Original Paper; Pareto efficiency; Pareto optimum; Schedules; Scheduling; Scheduling (Management); Scheduling algorithms; Studies; China; Batching machine; Pareto optimal solutions; 68Q25; 90B35; 90B50; Multicriteria scheduling; Maximum lateness
• ISSN: 1435-246X; 1613-9178
• DOI: 10.1007/s10100-011-0220-9

This paper studies the bicriteria problem of scheduling n jobs on a serial-batching machine to minimize maximum cost and makespan simultaneously. A serial-batching machine is a machine that can handle up to b jobs in a batch and jobs in a batch start and complete respectively at the same time and the processing time of a batch is equal to the sum of the processing times of jobs in the batch. When a new batch starts, a constant setup time s occurs. We confine ourselves to the unbounded model, where b  ≥ n . We present a polynomial-time algorithm for finding all Pareto optimal solutions of this bicriteria scheduling problem.