Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case

DOI10.1016/j.cor.2009.03.021zbMath1177.90140OpenAlexW2085694981MaRDI QIDQ1046704

Mohamed Ali Aloulou, Christian Artigues

Publication date: 22 December 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.03.021

zbMATH Keywords

robustnessflexibilityflow-shop schedulingdisjunctive schedulingworst-case performance evaluation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Single machine total tardiness maximization problems: complexity and algorithms ⋮ Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one ⋮ Robustness in operational research and decision aiding: a multi-faceted issue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximization problems in single machine scheduling
• An exact parallel method for a bi-objective permutation flowshop problem
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• Reducibility among single machine weighted completion time scheduling problems
• Counting linear extensions
• Adjustment of heads and tails for the job-shop problem
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Project scheduling under uncertainty: survey and research potentials
• Maximization of solution flexibility for robust shop scheduling
• Two-machine flowshop scheduling with a secondary criterion
• Benchmarks for basic scheduling problems
• Multicriteria scheduling
• Two-machine shop scheduling: Compromise between flexibility and makespan value
• Flowshop scheduling research after five decades
• 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
• Multicriteria scheduling problems: a survey
• An Algorithm for Solving the Job-Shop Problem
• A new method for workshop real time scheduling
• A new approach to computing optimal schedules for the job-shop scheduling problem

This page was built for publication: Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case