Complexity of the job insertion problem in multi-stage scheduling

DOI10.1016/J.ORL.2007.02.004zbMATH Open1180.90142OpenAlexW1986470794MaRDI QIDQ2467449FDOQ2467449

Authors Arjen P. A. Vestjens, Marc Wennink, 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

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

Recommendations

• Feasible job insertions in the multi-processor-task job shop
• A lower bound for the job insertion problem.
• Feasible insertions in job shop scheduling, short cycles and stable sets
• scientific article; zbMATH DE number 781213
• Optimal job insertion in the no-wait job shop

Cites work

• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A lower bound for the job insertion problem.
• Job Shop Scheduling by Local Search
• The complexity of shop-scheduling problems with two or three jobs

Cited in

(4)

• Feasible job insertions in the multi-processor-task job shop
• A lower bound for the job insertion problem.
• Feasible insertions in job shop scheduling, short cycles and stable sets
• Four decades of research on the open-shop scheduling problem to minimize the makespan

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467449)