Sequencing n jobs on two machines with setup, processing and removal times separated
From MaRDI portal
Publication:4750412
DOI10.1002/NAV.3800290313zbMATH Open0511.90073OpenAlexW2166189337MaRDI QIDQ4750412FDOQ4750412
Authors: Dileep R. Sule
Publication date: 1982
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800290313
Cited In (21)
- Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- An approximate solution of the flow-shop problem with sequence dependent setup times
- Flowshop-scheduling problems with makespan criterion: a review
- Group scheduling on two cells with intercell movement
- Job lateness in a two-machine flowshop with setup times separated
- Two-machine group scheduling problem with blocking and anticipatory setups
- Scheduling in stochastic flowshops with independent setup, processing and removal times
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
- Two-stage no-wait scheduling models with setup and removal times separated
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Two machine open shop scheduling problem with setup, processing and removal times separated
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan
- On non-permutation solutions to some two machine flow shop scheduling problems
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
This page was built for publication: Sequencing n jobs on two machines with setup, processing and removal times separated
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4750412)