Constraint guided accelerated search for mixed blocking permutation flowshop scheduling

DOI10.1016/J.COR.2018.10.003zbMath1458.90351OpenAlexW2897123348WikidataQ129106872 ScholiaQ129106872MaRDI QIDQ1628124

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

Publication date: 3 December 2018

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

Full work available at URL: http://hdl.handle.net/10072/382929

zbMATH Keywords

schedulinglocal searchflowshopblocking constraints

Mathematics Subject Classification ID

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

Related Items (5)

New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems ⋮ Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization ⋮ Scheduling blocking flowshops with setup times via constraint guided and accelerated local search ⋮ A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ Makespan preserving flowshop reengineering via blocking constraints

Cites Work

• Unnamed Item
• New hard benchmark for flowshop scheduling problems minimising makespan
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
• A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
• A comprehensive review and evaluation of permutation flowshop heuristics
• Local search methods for the flowshop scheduling problem with flowtime minimization
• Benchmarks for basic scheduling problems
• Optimal planning of part's machining on a number of machines
• Complexity of flowshop scheduling problems with a new blocking constraint
• The Complexity of Flowshop and Jobshop Scheduling
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Scheduling

This page was built for publication: Constraint guided accelerated search for mixed blocking permutation flowshop scheduling