A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
type: Item
instance of: scholarly article
title: A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
zbMATH Open document ID: 1065.90032
DOI: 10.1016/S0377-2217(03)00434-X
author: S. Bertel
author: J.-C. Billaut
published in: European Journal of Operational Research
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2117553
zbMATH Keywords: Scheduling
zbMATH Keywords: Heuristics
zbMATH Keywords: Genetic algorithm
zbMATH Keywords: Dispatching rules
MaRDI profile type: Publication
cites work: A generalized permutation approach to job shop scheduling with genetic algorithms
cites work: Branch and bound algorithm for the flow shop with multiple processors
cites work: Mathematical Modeling of Scheduling Problems
cites work: Q4840097
cites work: Minimizing late jobs in the general one machine scheduling problem
cites work: Flowshop scheduling with identical jobs and uniform parallel machines
cites work: Two-Stage, Hybrid Flowshop Scheduling Problem
cites work: Minimizing tardy jobs in a two-stage hybrid flowshop
cites work: Heuristic algorithms for the two-stage hybrid flowshop problem
cites work: A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
cites work: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
cites work: Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
cites work: Q4055377
cites work: Local search algorithms for the multiprocessor flow shop scheduling problem
cites work: The flow shop with parallel machines: A tabu search approach
cites work: A Survey of Scheduling Rules
cites work: Q3525910
cites work: A bicriteria two-machine permutation flowshop problem
cites work: Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
full work available at URL: s0377-2217(03)00434-x
OpenAlex ID: W2052457629
description: scientific article; zbMATH DE number 2117553