Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
type: Item
instance of: scholarly article
title: Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
zbMATH Open document ID: 1458.90351
author: Vahid Riahi
author: M. A. Hakim Newton
author: Kaile Su
author: Abdul Sattar
published in: Computers \& Operations Research
publication date: 2018-12-03T00:00:00Z
full work available at URL: http://hdl.handle.net/10072/382929
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6988147
zbMATH Keywords: flowshop
zbMATH Keywords: scheduling
zbMATH Keywords: blocking constraints
zbMATH Keywords: local search
MaRDI profile type: Publication
OpenAlex ID: W2897123348
cites work: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
cites work: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: Optimal planning of part's machining on a number of machines
cites work: Complexity of flowshop scheduling problems with a new blocking constraint
cites work: Local search methods for the flowshop scheduling problem with flowtime minimization
cites work: Scheduling
cites work: A comprehensive review and evaluation of permutation flowshop heuristics
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: Benchmarks for basic scheduling problems
cites work: Q5191184
cites work: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
cites work: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
cites work: Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
cites work: New hard benchmark for flowshop scheduling problems minimising makespan
cites work: A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
Wikidata QID: Q129106872
DOI: 10.1016/J.COR.2018.10.003
description: scientific article; zbMATH DE number 6988147