Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
type: Item
instance of: scholarly article
title: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
zbMATH Open document ID: 1391.90323
author: Y. Aharonov
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6901266
zbMATH Keywords: meta-heuristics
zbMATH Keywords: blocking flowshop
zbMATH Keywords: iterated greedy algorithm
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: constructive heuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2016.07.002
OpenAlex ID: W2472289588
cites work: Handbook on Scheduling
cites work: Sequencing of jobs in some production system
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3768703
cites work: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
cites work: Flowshop sequencing problems with limited buffer storage
cites work: Lower bounding schemes for flowshops with blocking in-process
cites work: Minimizing Cycle Time in a Blocking Flowshop
cites work: Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
cites work: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
cites work: Benchmarks for basic scheduling problems
cites work: An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
cites work: An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
cites work: An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
cites work: A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
cites work: A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: A fast tabu search algorithm for the permutation flow-shop problem
cites work: A two-machine permutation flow shop scheduling problem with buffers
cites work: The permutation flow shop with buffers: A tabu search approach
cites work: Variable neighborhood search
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
cites work: A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
cites work: A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
cites work: Local search methods for the flowshop scheduling problem with flowtime minimization
DOI: 10.1016/J.COR.2016.07.002
Recommended article: Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion
Recommended article: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
Recommended article: An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
Recommended article: A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
Recommended article: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
Recommended article: A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
Recommended article: A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
Recommended article: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Recommended article: Flowshop-scheduling problems with makespan criterion: a review
description: scientific article; zbMATH DE number 6901266