Scheduling blocking flowshops with setup times via constraint guided and accelerated local search

DOI10.1016/j.cor.2019.04.024zbMath1458.90337OpenAlexW2942672358MaRDI QIDQ2003564

Kaile Su, M. A. Hakim Newton, Vahid Riahi, Abdul Sattar

Publication date: 9 July 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.04.024

zbMATH Keywords

schedulinglocal searchflowshopsetup timesblocking constraints

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• The third comprehensive survey on scheduling problems with setup times/costs
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
• A comprehensive review and evaluation of permutation flowshop heuristics
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• Local search methods for the flowshop scheduling problem with flowtime minimization
• Benchmarks for basic scheduling problems
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Optimal planning of part's machining on a number of machines
• The Complexity of Flowshop and Jobshop Scheduling
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
• Scheduling