A robust approach for the single machine scheduling problem
From MaRDI portal
Publication:835547
DOI10.1007/s10951-007-0010-3zbMath1168.90425OpenAlexW2093453447MaRDI QIDQ835547
Cyril Briand, H. Trung La, Jacques Erschler
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0010-3
Related Items
The triangle scheduling problem ⋮ An analysis of the non-preemptive mixed-criticality match-up scheduling problem ⋮ Improving schedule stability in single-machine rescheduling for new operation insertion ⋮ Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure ⋮ Parallel machine match-up scheduling with manufacturing cost considerations
Cites Work
- The one-machine sequencing problem
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- On the optimal management of project risk
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
- Project scheduling under uncertainty: survey and research potentials
- Match-up scheduling under a machine breakdown
- The construction of stable project baseline schedules
- A new sufficient condition of optimality for the two-machine flowshop problem
- A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
- Simulation studies in JIT production
- The Price of Robustness
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
- Parallel Machine Scheduling with Uncertain Communication Delays
- Analysis of reactive scheduling problems in a job shop environment
