Optimal makespan scheduling with given bounds of processing times
From MaRDI portal
Recommendations
- Mean flow time minimization with given bounds of processing times
- Sequencing with uncertain numerical data for makespan minimisation
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 4053347 (Why is no real title available?)
- scientific article; zbMATH DE number 1301840 (Why is no real title available?)
- scientific article; zbMATH DE number 782644 (Why is no real title available?)
- On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function
- Optimal schedules with infinitely large stability radius∗
- Scheduling Multiple Variable-Speed Machines
- Some concepts of stability analysis in combinatorial optimization
- Stability of a schedule minimizing mean flow time
- Stability of an optimal schedule
- The job shop scheduling problem: Conventional and new solution techniques
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
- Two machine mixed shop scheduling problem with controllable machine speeds
- TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
Cited in
(22)- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Mean flow time minimization with given bounds of processing times
- Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
- Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
- Schedule execution for two-machine flow-shop with interval processing times
- 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
- Scheduling to minimize makespan about increase of processing times
- scientific article; zbMATH DE number 4016584 (Why is no real title available?)
- Sequencing with uncertain numerical data for makespan minimisation
- Single machine scheduling problem with interval processing times to minimize mean weighted completion time
- scientific article; zbMATH DE number 6820261 (Why is no real title available?)
- Minimizing total weighted completion time with uncertain data: a stability approach
- An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flows
- Group shops scheduling with makespan criterion subject to random release dates and processing times
- Optimality region for job permutation in single-machine scheduling with uncertain processing times
- Stability polyhedra of optimal permutation of jobs servicing
- 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
This page was built for publication: Optimal makespan scheduling with given bounds of processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1381777)
