A robust approach for the single machine scheduling problem
type: Item
instance of: scholarly article
title: A robust approach for the single machine scheduling problem
zbMATH Open document ID: 1168.90425
author: Cyril Briand
author: H. Trung La
author: Jacques Erschler
published in: Journal of Scheduling
publication date: 2009-08-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5599823
zbMATH Keywords: scheduling
zbMATH Keywords: robustness
zbMATH Keywords: sequential flexibility
zbMATH Keywords: interval structures
zbMATH Keywords: pyramids
MaRDI profile type: Publication
full work available at URL: s10951-007-0010-3
OpenAlex ID: W2093453447
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Match-up scheduling under a machine breakdown
cites work: The Price of Robustness
cites work: A new sufficient condition of optimality for the two-machine flowshop problem
cites work: The one-machine sequencing problem
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
cites work: Simulation studies in JIT production
cites work: A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time
cites work: Project scheduling under uncertainty: survey and research potentials
cites work: The construction of stable project baseline schedules
cites work: Parallel Machine Scheduling with Uncertain Communication Delays
cites work: Analysis of reactive scheduling problems in a job shop environment
cites work: On the optimal management of project risk
cites work: A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
DOI: 10.1007/S10951-007-0010-3
Recommended article: On the robust single machine scheduling problem
Recommended article: Algorithms and complexity analysis for robust single-machine scheduling problems
Recommended article: Robust scheduling on a single machine to minimize total flow time
Recommended article: A GRASP for a difficult single machine scheduling problem
Recommended article: Single machine robust scheduling with budgeted uncertainty
Recommended article: Robustness of single machine scheduling problems to earliness and tardiness penalty errors
Recommended article: Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion
Recommended article: Distributionally robust single machine scheduling with the total tardiness criterion
Recommended article: A family of inequalities valid for the robust single machine scheduling polyhedron
Recommended article: Q4343701
description: scientific article; zbMATH DE number 5599823