Fast heuristics for minimizing the makespan in non-permutation flow shops
type: Item
instance of: scholarly article
title: Fast heuristics for minimizing the makespan in non-permutation flow shops
zbMATH Open document ID: 1458.90254
author: Alexander J. Benavides
author: Marcus Ritt
published in: Computers \& Operations Research
publication date: 2018-09-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6938904
zbMATH Keywords: scheduling
zbMATH Keywords: metaheuristics
zbMATH Keywords: flow shop
zbMATH Keywords: non-permutation schedules
zbMATH Keywords: makespan
zbMATH Keywords: iterated greedy algorithm
MaRDI profile type: Publication
full work available at URL: j.cor.2018.07.017
OpenAlex ID: W2884652221
cites work: Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
cites work: Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
cites work: Q4658190
cites work: Throughput optimization in robotic cells
cites work: An improved NEH-based heuristic for the permutation flowshop problem
cites work: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
cites work: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
cites work: Nonparametric statistical methods
cites work: An empirical analysis of the optimality rate of flow shop heuristics
cites work: A new constructive heuristic for the flowshop scheduling problem
cites work: An effective differential evolution algorithm for permutation flow shop scheduling problem
cites work: A Friedman-Type Rank Test for Main Effects in a Two-Factor ANOVA
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Some aspects of scatter search in the flow-shop problem
cites work: Scheduling flow shops using differential evolution algorithm
cites work: Permutation vs. non-permutation flow shop schedules
cites work: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
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: A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
cites work: Cooperative metaheuristics for the permutation flowshop scheduling problem
cites work: New hard benchmark for flowshop scheduling problems minimising makespan
cites work: Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
Wikidata QID: Q129506736
DOI: 10.1016/J.COR.2018.07.017
description: scientific article; zbMATH DE number 6938904