A heuristic algorithm for two-machine re-entrant shop scheduling
From MaRDI portal
Recommendations
- A New Heuristic for Three-Machine Flow Shop Scheduling
- Heuristic algorithms for two machine re-entrant flow shop
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
- Minimizing total completion time for re-entrant flow shop scheduling problems
- Minimizing makespan on a two-machine re-entrant flowshop
Cited in
(14)- Multi-family scheduling in a two-machine reentrant flow shop with setups
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
- Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions
- Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
- On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
- Scheduling reentrant jobs on parallel machines with a remote server
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- New efficient algorithms for the two-machine no-wait chain-reentrant shop problem
- Minimizing total tardiness on a two-machine re-entrant flowshop
- Minimizing total completion time for re-entrant flow shop scheduling problems
- On scheduling cycle shops: Classification, complexity and approximation
- Heuristic algorithms for two machine re-entrant flow shop
- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
This page was built for publication: A heuristic algorithm for two-machine re-entrant shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290158)
