New heuristics for no-wait flowshops to minimize makespan.
From MaRDI portal
Publication:1413816
DOI10.1016/S0305-0548(02)00068-0zbMath1047.90053OpenAlexW2022520278MaRDI QIDQ1413816
Ali Allahverdi, Tariq A. Aldowaisan
Publication date: 17 November 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00068-0
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (29)
Processing element allocation and dynamic scheduling codesign for multi-function SoCs ⋮ A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS ⋮ Some local search algorithms for no-wait flow-shop problem with makespan criterion ⋮ A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions ⋮ Minimizing total tardiness in no-wait flowshops ⋮ Heuristic for no-wait flow shops with makespan minimization ⋮ Some effective heuristics for no-wait flowshops with setup times to minimize total completion time ⋮ A survey of scheduling problems with no-wait in process ⋮ No-wait job shop scheduling: tabu search and complexity of subproblems ⋮ Heuristics for no-wait flowshops with makespan subject to mean completion time ⋮ A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments ⋮ An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops ⋮ An improved particle swarm optimization algorithm for flowshop scheduling problem ⋮ Scheduling two-machine no-wait open shops to minimize makespan ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics ⋮ Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Minimizing makespan for a no-wait flowshop using genetic algorithm ⋮ No-wait two-stage flowshop problem with multi-task flexibility of the first machine ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
Cites Work
- A genetic algorithm for flowshop sequencing
- Total flowtime in no-wait flowshops with separated setup times.
- Heuristic algorithms for continuous flow-shop problem
- Solvable Cases of the No-wait Flow-shop Scheduling Problem
- Solutions to the Constrained Flowshop Sequencing Problem
- An Evaluation of Flow Shop Sequencing Heuristics
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- 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
This page was built for publication: New heuristics for no-wait flowshops to minimize makespan.
