Multiple-Machine Lower Bounds for Shop-Scheduling Problems

DOI10.1287/IJOC.12.4.341.11881zbMath1238.90070OpenAlexW2163942338MaRDI QIDQ2884494

Francis Sourd, Wim Nuijten

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.12.4.341.11881

zbMATH Keywords

integer programmingbranch and bound

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

New single machine and job-shop scheduling problems with availability constraints ⋮ An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective ⋮ Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties ⋮ Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results

This page was built for publication: Multiple-Machine Lower Bounds for Shop-Scheduling Problems