Constraint guided accelerated search for mixed blocking permutation flowshop scheduling

DOI10.1016/J.COR.2018.10.003zbMATH Open1458.90351OpenAlexW2897123348WikidataQ129106872 ScholiaQ129106872MaRDI QIDQ1628124FDOQ1628124

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

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

local searchschedulingflowshopblocking constraints

Mathematics Subject Classification ID

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

Recommendations

• Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
• New block properties for the permutation flow shop problem with application in tabu search
• A permutation-based neighborhood for the blocking job-shop problem with total tardiness minimization
• Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

Cites work

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

Cited in

(6)

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

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

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