Sequencing with uncertain numerical data for makespan minimisation

DOI10.1057/palgrave.jors.2600690zbMath1054.90549OpenAlexW1981918980MaRDI QIDQ3157317

Yuri N. Sotskov, Tsung-Chyan Lai

Publication date: 13 January 2005

Published in: 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

uncertaintymakespanoptimal schedulingmixed graph

Mathematics Subject Classification ID

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

Related Items (19)

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

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