A robust approach for the single machine scheduling problem

DOI10.1007/S10951-007-0010-3MaRDI QIDQ835547zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

robustnessschedulingpyramidsinterval structuressequential flexibility

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the robust single machine scheduling problem
• Algorithms and complexity analysis for robust single-machine scheduling problems
• Robust scheduling on a single machine to minimize total flow time
• A GRASP for a difficult single machine scheduling problem
• Single machine robust scheduling with budgeted uncertainty
• Robustness of single machine scheduling problems to earliness and tardiness penalty errors
• Robust single machine scheduling problem with weighted number of late jobs criterion
• Distributionally robust single machine scheduling with the total tardiness criterion
• A family of inequalities valid for the robust single machine scheduling polyhedron
• scientific article; zbMATH DE number 1031378

Cites work

• A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
• A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
• A new sufficient condition of optimality for the two-machine flowshop problem
• An Algorithm for Solving the Job-Shop Problem
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Analysis of reactive scheduling problems in a job shop environment
• Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
• Match-up scheduling under a machine breakdown
• On the optimal management of project risk
• Parallel Machine Scheduling with Uncertain Communication Delays
• Project scheduling under uncertainty: survey and research potentials
• Simulation studies in JIT production
• The Price of Robustness
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The construction of stable project baseline schedules
• The one-machine sequencing problem

Cited in

(11)

• Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
• An analysis of the non-preemptive mixed-criticality match-up scheduling problem
• Robust single machine makespan scheduling with release date uncertainty
• On the robust single machine scheduling problem
• scientific article; zbMATH DE number 5007490 (Why is no real title available?)
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Parallel machine match-up scheduling with manufacturing cost considerations
• The triangle scheduling problem
• Application of the interpolation approach for approximating single-machine scheduling problem with an unknown objective function
• Improving schedule stability in single-machine rescheduling for new operation insertion
• Extending the single machine-based relaxation scheme for the job shop scheduling problem

This page was built for publication: A robust approach for the single machine scheduling problem

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