Schedule execution for two-machine flow-shop with interval processing times
From MaRDI portal
Publication:2390053
DOI10.1016/j.mcm.2008.02.004zbMath1165.90464OpenAlexW2113853416MaRDI QIDQ2390053
N. M. Matsveichuk, Tsung-Chyan Lai, Natalja G. Egorova, Yuri N. Sotskov
Publication date: 20 July 2009
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2008.02.004
Related Items
Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times ⋮ An integrated model for production planning and cell formation in cellular manufacturing systems ⋮ Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times ⋮ Minimizing total weighted completion time with uncertain data: a stability approach ⋮ Stability polyhedra of optimal permutation of jobs servicing ⋮ Optimal results and numerical simulations for flow shop scheduling problems ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ 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 ⋮ A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times ⋮ The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
Cites Work
- Unnamed Item
- Two-machine ordered flowshop scheduling under random breakdowns
- Optimal makespan scheduling with given bounds of processing times
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- Single machine batch scheduling with jointly compressible setup and processing times.
- Minmax regret solutions for minimax optimization problems with uncertainty
- Stochastically minimizing total flowtime in flowshops with no waiting space
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- Mean flow time minimization with given bounds of processing times
- Benchmarks for basic scheduling problems
- Scheduling with controllable release dates and processing times: Makespan minimization
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Approximation schemes for job shop scheduling problems with controllable processing times
- Johnson's problem with stochastic processing times and optimal service level
- A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
- Optimal two- and three-stage production schedules with setup times included
- Sequencing with uncertain numerical data for makespan minimisation
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
