The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard

Authors:
T. C. E. Cheng;C. T. Ng;J. J. Yuan
Affiliations:
Department of Logistics, Faculty of Business, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China;Department of Logistics, Faculty of Business, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, People's Republic of China
Venue:
Journal of Scheduling
Year:
2003

Citing 2
Cited 7

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Batch scheduling to minimize maximum lateness

Operations Research Letters

Single machine batch scheduling problem with family setup times and release dates to minimize makespan

Journal of Scheduling
A simulated annealing algorithm for single machine scheduling problems with family setups

Computers and Operations Research
Machine scheduling with job class setup and delivery considerations

Computers and Operations Research
Integrated Production and Outbound Distribution Scheduling: Review and Extensions

Operations Research
A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups

Computers and Operations Research
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

Journal of Scheduling
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the single machine batching problem with family setup times to minimize maximum lateness. While the problem was proved to be binary NP-hard in 1978, whether the problem is strongly NP-hard is a long-standing open question. We show that this problem is strongly NP-hard.