The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times

DOI10.1080/02331931003657691zbMath1233.90166OpenAlexW2022805676WikidataQ57633868 ScholiaQ57633868MaRDI QIDQ3111147

Yuri N. Sotskov, N. M. Matsveichuk, Frank Werner

Publication date: 18 January 2012

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331931003657691

zbMATH Keywords

uncertaintyschedulingmakespandominance relation

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Reliability analysis in presence of random variables and fuzzy variables ⋮ Measures of problem uncertainty for scheduling with interval processing times ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ Uncertainty measure for the Bellman-Johnson problem with interval processing times ⋮ A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure ⋮ Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times

Cites Work

• Necessary and sufficient conditions of optimality for some classical scheduling problems
• Minimizing total weighted flow time of a set of jobs with interval processing times
• Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
• Executing production schedules in the face of uncertainties: a review and some future directions
• Mean flow time minimization with given bounds of processing times
• Schedule execution for two-machine flow-shop with interval processing times
• A new sufficient condition of optimality for the two-machine flowshop problem
• Optimal two- and three-stage production schedules with setup times included
• Sequencing with uncertain numerical data for makespan minimisation
• A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
• Flowshop scheduling problem to minimize total completion time with random and bounded processing times
• Two-machine flowshop minimum-length scheduling problem with random and bounded processing times

This page was built for publication: The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times