Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan

Authors:
Cheng He;Yixun Lin;Jinjiang Yuan
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China and Institute of Science, Information Engineering University of PLA, Zhengzhou, Henan 450001, Pe ...;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China
Venue:
Theoretical Computer Science
Year:
2007

Citing 5
Cited 1

Single-machine scheduling to minimize a function of two or three maximum cost criteria

Journal of Algorithms
Scheduling Algorithms

Scheduling Algorithms
A Multiple-Criterion Model for Machine Scheduling

Journal of Scheduling
Scheduling Problems with Two Competing Agents

Operations Research
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

Operations Research Letters

A DP algorithm for minimizing makespan and total completion time on a series-batching machine

Information Processing Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper studies the bicriteria problem of scheduling n jobs on a batching machine to minimize maximum lateness and makespan simultaneously. A parallel-batching machine is a machine that can handle up to b jobs in a batch. The jobs in a batch start and complete at the same time, respectively, and the processing time of a batch is equal to the largest processing time of jobs in the batch. We analyse the unbounded model, where b=n. We present a polynomial-time algorithm for finding all Pareto optimal solutions of this bicriteria scheduling problem.