Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem

DOI10.1287/opre.19.7.1753zbMath0227.90030OpenAlexW2055285724MaRDI QIDQ5635251

Jatinder N. D. Gupta

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1287/opre.19.7.1753

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Minimizing makespan in a two-machine flowshop scheduling with batching and release time ⋮ Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Flow-shops with a dominant machine ⋮ Generating improved dominance conditions for the flowshop problem ⋮ Flowshop scheduling research after five decades

This page was built for publication: Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem