A polynomial approximation scheme for problem F2/rj/Cmax
- 28 February 1997
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 20 (2) , 75-79
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling ProblemMathematics of Operations Research, 1994
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic BetterMathematics of Operations Research, 1992
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release DatesMathematics of Operations Research, 1985
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- General Techniques for Combinatorial ApproximationOperations Research, 1977
- Complexity of Machine Scheduling Problems1977
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969
- Scheduling Independent Tasks on Parallel ProcessorsManagement Science, 1966
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954