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

DOI10.1016/J.COR.2019.04.024MaRDI QIDQ2003564zbMATH OpenOpenAlexFDO

Authors M. A. Hakim Newton, Vahid Riahi, Kaile Su, 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

blocking constraintsflowshoplocal searchschedulingsetup times

Mathematics Subject Classification ID

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

Recommendations

• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
• A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
• Complexity of flowshop scheduling problems with a new blocking constraint
• Algorithms for a realistic variant of flowshop scheduling
• Flow shop scheduling with flexible processing times

Cites work

• A comprehensive review and evaluation of permutation flowshop heuristics
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Benchmarks for basic scheduling problems
• Constraint guided accelerated search for mixed blocking permutation flowshop 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
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
• scientific article; zbMATH DE number 1054674 (Why is no real title available?)
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• Local search methods for the flowshop scheduling problem with flowtime minimization
• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
• Optimal planning of part's machining on a number of machines
• Scheduling. Theory, algorithms, and systems
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• Some efficient heuristic methods for the flow shop sequencing problem
• The Complexity of Flowshop and Jobshop Scheduling
• The third comprehensive survey on scheduling problems with setup times/costs

Cited in

(6)

• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
• Efficient primal heuristic updates for the blocking job shop problem
• scientific article; zbMATH DE number 5525237 (Why is no real title available?)
• Flow shop scheduling with inter-stage flexibility and blocking constraints
• Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach
• The fourth comprehensive review of scheduling problems with setup times

This page was built for publication: Scheduling blocking flowshops with setup times via constraint guided and accelerated local search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003564)