On non-permutation solutions to some two machine flow shop scheduling problems
From MaRDI portal
Recommendations
- Permutation schedules for a two-machine flow shop with storage
- Two-machine flow shops with an optimal permutation schedule under a storage constraint
- Permutation vs. non-permutation flow shop schedules
- A flowshop scheduling problem with two operations per job
- The two-machine permutation flow shop with state-dependent processing times
Cites work
- Flowshop scheduling with limited temporary storage
- Optimal two- and three-stage production schedules with set-up time included
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Sequencing n jobs on two machines with setup, processing and removal times separated
- Sequency on two and three machines with setup, processing and removal times separated
- The Complexity of Flowshop and Jobshop Scheduling
- Two machine open shop scheduling problem with setup, processing and removal times separated
Cited in
(23)- The two-machine sequence dependent flowshop scheduling problem
- Permutation vs. non-permutation flow shop schedules
- Variants of the two machine flow shop problem connected with factorization of matrix functions
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Two-machine group scheduling problem with blocking and anticipatory setups
- Two-stage no-wait scheduling models with setup and removal times separated
- Permutation schedules for a two-machine flow shop with storage
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
- Minimizing functions of infeasibilities in a two-machine flow shop
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine
- Two-machine flow shops with an optimal permutation schedule under a storage constraint
- Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
- Analysis of flow shop scheduling anomalies
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
- Two-machine mixed shop problem with setup, processing and removal time separated
- scientific article; zbMATH DE number 4209899 (Why is no real title available?)
- A flowshop scheduling problem with two operations per job
- scientific article; zbMATH DE number 2156294 (Why is no real title available?)
- scientific article; zbMATH DE number 764419 (Why is no real title available?)
- Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy
This page was built for publication: On non-permutation solutions to some two machine flow shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4300604)
