Maximization of solution flexibility for robust shop scheduling

DOI10.1016/j.ejor.2004.04.004zbMath1066.90022OpenAlexW1986237126MaRDI QIDQ1772837

Carl Esswein, Christian Artigues, Jean-Charles Billaut

Publication date: 21 April 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.004

zbMATH Keywords

Dynamic programmingRelease datesFlexibilityShop schedulingDeadlines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns, A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size, The impact of design uncertainty in engineer-to-order project planning, Solve-and-robustify, Maximising the weighted number of activity execution modes in project planning, Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties, Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case

Cites Work

• Unnamed Item
• A branch and bound algorithm for the job-shop scheduling problem
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Project scheduling under uncertainty: survey and research potentials
• A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
• Multicriteria scheduling problems: a survey
• The Shifting Bottleneck Procedure for Job Shop Scheduling