Total flowtime in no-wait flowshops with separated setup times.
From MaRDI portal
Recommendations
- Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
- Job lateness in flowshops with setup and removal times separated
- Minimal total completion time in two-machine flow shop with setup, processing and removal time separated
- A new heuristic and dominance relations for no-wait flowshops with setups
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
Cites work
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- An Evaluation of Flow Shop Sequencing Heuristics
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- Heuristic algorithms for continuous flow-shop problem
- Job lateness in a two-machine flowshop with setup times separated
- Job lateness in flowshops with setup and removal times separated
- Scheduling in stochastic flowshops with independent setup, processing and removal times
- Sequency on two and three machines with setup, processing and removal times separated
- Solvable Cases of the No-wait Flow-shop Scheduling Problem
- Two-machine group scheduling problem with blocking and anticipatory setups
- Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
Cited in
(22)- Scheduling of job-block with dead line in n\(\times 2\) flowshop problem with separated set up times
- New heuristics for no-wait flowshops to minimize makespan.
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
- A survey of scheduling problems with no-wait in process
- A note on minimizing maximum lateness in a two-machine no-wait flowshop
- Flow-shop scheduling for three serial stations with the last two duplicate
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
- A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups
- Total completion time with makespan constraint in no-wait flowshops with setup times
- Job lateness in flowshops with setup and removal times separated
- Flowshop/no-idle scheduling to minimise the mean flowtime
- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
- Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
- The flow shop problem with time lags and separated setup times
- Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
- Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
- Minimal total completion time in two-machine flow shop with setup, processing and removal time separated
- Flowshop-scheduling problems with makespan criterion: a review
- A new heuristic and dominance relations for no-wait flowshops with setups
This page was built for publication: Total flowtime in no-wait flowshops with separated setup times.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406685)
