Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
From MaRDI portal
Publication:2468768
DOI10.1007/s10479-007-0227-8zbMath1145.90027OpenAlexW1967761074MaRDI QIDQ2468768
Publication date: 25 January 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0227-8
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Total completion time with makespan constraint in no-wait flowshops with setup times, Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study, Nested simulated annealing approach to periodic routing problem of a retail distribution system, A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks, An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs, A survey of scheduling problems with setup times or costs, A survey of scheduling problems with no-wait in process, Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Job lateness in a two-machine flowshop with setup times separated
- Two-stage no-wait scheduling models with setup and removal times separated
- Total flowtime in no-wait flowshops with separated setup times.
- New heuristics for no-wait flowshops to minimize makespan.
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
- A comprehensive review and evaluation of permutation flowshop heuristics
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- Heuristic algorithms for continuous flow-shop problem
- Sequency on two and three machines with setup, processing and removal times separated
- The Three-Machine No-Wait Flow Shop is NP-Complete
- The Lessons of Flowshop Scheduling Research
- Optimal flowshop schedules with no intermediate storage space
- Solutions to the Constrained Flowshop Sequencing Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
- Sequencing n jobs on two machines with setup, processing and removal times separated
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- A new heuristic and dominance relations for no-wait flowshops with setups
