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.
| Original language | English |
|---|---|
| Pages (from-to) | 483-490 |
| Number of pages | 8 |
| Journal | Journal of Scheduling |
| Volume | 6 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 1 Sept 2003 |
Keywords
- Batching
- Due-dates
- Maximum lateness
- Multi-operation jobs
- Scheduling
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering
- Management Science and Operations Research
Fingerprint
Dive into the research topics of 'The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver