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

DOI10.1080/02331931003657691zbMATH Open1233.90166OpenAlexW2022805676WikidataQ57633868 ScholiaQ57633868MaRDI QIDQ3111147FDOQ3111147

Authors N. M. Matsveichuk, Yuri N. Sotskov, 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

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

Recommendations

• Two-machine flow-shop minimum-length scheduling with interval processing times
• Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
• Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
• Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness

Cites work

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

Cited in

(10)

• Two-machine flow-shop minimum-length scheduling with interval processing times
• Measures of problem uncertainty for scheduling with interval processing times
• Schedule execution for two-machine flow-shop with interval processing times
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
• Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
• Reliability analysis in presence of random variables and fuzzy variables
• Optimal selection and scheduling of jobs with uncertain durations for two employees
• A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
• Uncertainty measure for the Bellman-Johnson problem with interval processing times
• Application of digraph theory to process scheduling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3111147)