Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
type: Item
instance of: scholarly article
title: Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
zbMATH Open document ID: 1177.90140
author: Mohamed Ali Aloulou
author: Christian Artigues
published in: Computers \& Operations Research
publication date: 2009-12-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5651576
zbMATH Keywords: disjunctive scheduling
zbMATH Keywords: flow-shop scheduling
zbMATH Keywords: flexibility
zbMATH Keywords: robustness
zbMATH Keywords: worst-case performance evaluation
MaRDI profile type: Publication
full work available at URL: j.cor.2009.03.021
OpenAlex ID: W2085694981
cites work: Q5702319
cites work: Maximization of solution flexibility for robust shop scheduling
cites work: A new method for workshop real time scheduling
cites work: A new sufficient condition of optimality for the two-machine flowshop problem
cites work: Q4140720
cites work: Two-machine shop scheduling: Compromise between flexibility and makespan value
cites work: A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
cites work: Counting linear extensions
cites work: Project scheduling under uncertainty: survey and research potentials
cites work: Maximization problems in single machine scheduling
cites work: Benchmarks for basic scheduling problems
cites work: Q3760254
cites work: Multicriteria scheduling problems: a survey
cites work: Multicriteria scheduling
cites work: Reducibility among single machine weighted completion time scheduling problems
cites work: Q4055377
cites work: Q4198056
cites work: An exact parallel method for a bi-objective permutation flowshop problem
cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
cites work: Two-machine flowshop scheduling with a secondary criterion
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems.
cites work: A new approach to computing optimal schedules for the job-shop scheduling problem
cites work: Adjustment of heads and tails for the job-shop problem
cites work: Flowshop scheduling research after five decades
DOI: 10.1016/J.COR.2009.03.021
description: scientific article; zbMATH DE number 5651576