Optimal makespan scheduling with given bounds of processing times
From MaRDI portal
Publication:1381777
DOI10.1016/S0895-7177(97)00132-5zbMath0895.90118WikidataQ57633984 ScholiaQ57633984MaRDI QIDQ1381777
Frank Werner, Tsung-Chyan Lai, Nadezhda Sotskova, Yuri N. Sotskov
Publication date: 7 September 1998
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Optimality region for job permutation in single-machine scheduling with uncertain processing times ⋮ Mean flow time minimization with given bounds of processing times ⋮ Heuristic algorithms for the minmax regret flow-shop problem with interval 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 ⋮ Minimizing total weighted completion time with uncertain data: a stability approach ⋮ Stability polyhedra of optimal permutation of jobs servicing ⋮ 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 completion time in a two-machine no-wait flowshop with uncertain and bounded setup 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stability of an optimal schedule
- The job shop scheduling problem: Conventional and new solution techniques
- On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function
- Stability of a schedule minimizing mean flow time
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
- Some concepts of stability analysis in combinatorial optimization
- Two machine mixed shop scheduling problem with controllable machine speeds
- TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
- Scheduling Multiple Variable-Speed Machines
- Optimal schedules with infinitely large stability radius∗
