The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
From MaRDI portal
Publication:2475853
DOI10.1016/J.COR.2007.01.002zbMATH Open1144.90399OpenAlexW1993612955MaRDI QIDQ2475853FDOQ2475853
Publication date: 11 March 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.01.002
Recommendations
- Scheduling a single server in a two-machine flow shop
- Two-machine flow-shop scheduling problems with minimizing the total completion times
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- Two-machine flow shop problems with a single server
- Scheduling for parallel dedicated machines with a single server
Cites Work
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- The Complexity of Flowshop and Jobshop Scheduling
- Total flowtime in no-wait flowshops with separated setup times.
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Complexity results for flow-shop problems with a single server
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- Some new results in flow shop scheduling
- Heuristic algorithms for continuous flow-shop problem
- One-operator-two-machine flowshop scheduling with setup and dismounting times
- Two-machine flowshop scheduling to minimize mean flow time
- A new heuristic and dominance relations for no-wait flowshops with setups
- Total completion time minimization in a computer system with a server and two parallel processors
Cited In (11)
- A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
- Total completion time minimization in a computer system with a server and two parallel processors
- A note on minimizing maximum lateness in a two-machine no-wait flowshop
- Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times
- No-wait flexible flow shop scheduling with due windows
- Complexity results for flow-shop problems with a single server
- Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines
- Single-server parallel-machine scheduling with loading and unloading times
- Parallel Machine Scheduling with a Single Server: Loading and Unloading
- No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
- A survey of scheduling problems with no-wait in process
This page was built for publication: The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2475853)
