Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints
Authors:
- 1 March 2004
- journal article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 8 (1) , 13-28
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The open shop scheduling problem with a given sequence of jobs on one machineNaval Research Logistics (NRL), 1998
- Shop scheduling problems under precedence constraintsAnnals of Operations Research, 1997
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic BetterMathematics of Operations Research, 1992
- The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and ExtensionsOperations Research, 1979
- The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence RelationsOperations Research, 1979
- Sequencing with Series-Parallel Precedence ConstraintsMathematics of Operations Research, 1979
- Complexity of Machine Scheduling Problems1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Optimal Sequencing of a Single Machine Subject to Precedence ConstraintsManagement Science, 1973
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954