Multiple-Machine Lower Bounds for Shop-Scheduling Problems
From MaRDI portal
Publication:2884494
DOI10.1287/ijoc.12.4.341.11881zbMath1238.90070MaRDI QIDQ2884494
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
68W40: Analysis of algorithms
90C10: Integer programming
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective, Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results, New single machine and job-shop scheduling problems with availability constraints