Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems

DOI10.1287/MOOR.7.4.532MaRDI QIDQ3964310zbMATH OpenOpenAlexFDO

Authors James O. Achugbue, Francis Y. L. Chin

Publication date 1982

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.7.4.532

zbMATH Keywords

NP-completenessminimal length non-preemptive scheduling problempolynomial scheduling algorithmsthree-stage flow shop

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(2)

• A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
• Applications of max-plus algebra to flow shop scheduling problems

This page was built for publication: Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964310)