Batch scheduling and common due date assignment problem: An NP-hard case

DOI10.1016/S0166-218X(97)00092-9zbMath0894.68011OpenAlexW2011637884MaRDI QIDQ1382284

Mikhail Y. Kovalyov

Publication date: 19 August 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

computational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Single machine scheduling with assignable due dates ⋮ Scheduling with batching: A review ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research

Cites Work

• Unnamed Item
• Batch scheduling and common due-date assignment on a single machine