Complexity of the job insertion problem in multi-stage scheduling

DOI10.1016/j.orl.2007.02.004zbMath1180.90142OpenAlexW1986470794MaRDI QIDQ2467449

Marc Wennink, Arjen P. A. Vestjens, Gerhard J. Woeginger

Publication date: 21 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.02.004

zbMATH Keywords

computational complexityscheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Four decades of research on the open-shop scheduling problem to minimize the makespan

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of shop-scheduling problems with two or three jobs
• A lower bound for the job insertion problem.
• Job Shop Scheduling by Local Search

This page was built for publication: Complexity of the job insertion problem in multi-stage scheduling