A robust approach for the single machine scheduling problem

DOI10.1007/S10951-007-0010-3zbMATH Open1168.90425OpenAlexW2093453447MaRDI QIDQ835547FDOQ835547

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)

Cites Work

• The Price of Robustness
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Project scheduling under uncertainty: survey and research potentials
• The construction of stable project baseline schedules
• The one-machine sequencing 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
• Match-up scheduling under a machine breakdown
• A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
• A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
• A new sufficient condition of optimality for the two-machine flowshop problem
• Parallel Machine Scheduling with Uncertain Communication Delays
• 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.
• Simulation studies in JIT production

Cited In (10)

• Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Robust single machine makespan scheduling with release date uncertainty
• The triangle scheduling problem
• Extending the single machine-based relaxation scheme for the job shop 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
• An analysis of the non-preemptive mixed-criticality match-up scheduling problem
• Parallel machine match-up scheduling with manufacturing cost considerations
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• A family of inequalities valid for the robust single machine scheduling polyhedron 👍 👎
• Single machine robust scheduling with budgeted uncertainty 👍 👎
• On the robust single machine scheduling problem 👍 👎
• Robust scheduling on a single machine to minimize total flow time 👍 👎
• A GRASP for a difficult single machine scheduling problem 👍 👎
• Algorithms and complexity analysis for robust single-machine scheduling problems 👍 👎
• Robustness of single machine scheduling problems to earliness and tardiness penalty errors 👍 👎
• Distributionally robust single machine scheduling with the total tardiness criterion 👍 👎
• Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion 👍 👎

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)