Heuristic for no-wait flow shops with makespan minimization

DOI10.1080/00207540701737997zbMath1160.90415OpenAlexW2119301502MaRDI QIDQ5385488

Qian Wang, Cheng Wu, Xiao-Ping Li

Publication date: 6 May 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701737997

zbMATH Keywords

schedulingmakespanheuristicno-wait flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items

Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects ⋮ A survey of scheduling problems with no-wait in process ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ Minimizing makespan for a no-wait flowshop using genetic algorithm

Cites Work

• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• New heuristics for no-wait flowshops to minimize makespan.
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process