On the complexity of bi-criteria scheduling on a single batch processing machine

Authors:
L. L. Liu;C. T. Ng;T. C. Cheng
Affiliations:
School of Science, Shanghai Second Polytechnic University, Pudong, China 201209;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Hong Kong;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Hong Kong
Venue:
Journal of Scheduling
Year:
2010

Citing 2
Cited 1

Minimizing total weighted tardiness on a single batch process machine with incompatible job families

Computers and Operations Research
On scheduling an unbounded batch machine

Operations Research Letters

Bounded parallel-batching scheduling with two competing agents

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers hierarchical bi-criteria scheduling on a single batch processing machine where the primary criterion is the makespan. We show that the problem where the secondary criterion is the total completion time can be solved in polynomial time for a given machine capacity and the problem where the secondary criterion is the (weighted) number of late jobs is (strongly) NP-hard.