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

Research output: Journal article publicationJournal articleAcademic researchpeer-review

21 Citations (Scopus)

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.

Keyphrases

Mathematics