Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations

DOI10.1023/A:1018924517216zbMath0911.90210OpenAlexW18845368MaRDI QIDQ1273121

Adam Janiak, Marie-Claude Portmann

Publication date: 6 December 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018924517216

zbMATH Keywords

makespanlinear modelsgenetic algorithmheuristicstrongly NP-hardpermutation flow-shopjob operationsprocessing order of jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

A survey of scheduling with controllable processing times ⋮ Two-machine open shop problem with controllable processing times ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ Heuristics for hybrid flow shops with controllable processing times and assignable due dates

This page was built for publication: Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations