Sequencing with uncertain numerical data for makespan minimisation

DOI10.1057/PALGRAVE.JORS.2600690MaRDI QIDQ3157317zbMATH OpenOpenAlexFDO

Authors Tsung-Chyan Lai, Yuri N. Sotskov

Publication date 13 January 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600690

zbMATH Keywords

uncertaintymixed graphoptimal schedulingmakespan

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 2073567
• Optimal makespan scheduling with given bounds of processing times
• Minimizing total weighted completion time with uncertain data: a stability approach
• Mean flow time minimization with given bounds of processing times
• scientific article; zbMATH DE number 4125190

Cited in

(19)

• The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
• Stability polyhedra of optimal permutation of jobs servicing
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
• Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
• Single machine scheduling problem with interval processing times to minimize mean weighted completion time
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
• Two-machine flow-shop minimum-length scheduling with interval processing times
• Measures of problem uncertainty for scheduling with interval processing times
• Group shops scheduling with makespan criterion subject to random release dates and processing times
• Schedule execution for two-machine flow-shop with interval processing times
• Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
• Minimizing total weighted completion time with uncertain data: a stability approach
• Mean flow time minimization with given bounds of processing times
• Minimizing total weighted flow time of a set of jobs with interval processing times
• Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks
• Exact solutions for the two-machine robust flow shop with budgeted uncertainty
• Minimizing total weighted flow time under uncertainty using dominance and a stability box
• Uncertainty measure for the Bellman-Johnson problem with interval processing times

This page was built for publication: Sequencing with uncertain numerical data for makespan minimisation

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