A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
From MaRDI portal
Publication:1376266
DOI10.1016/S0167-6377(96)00049-1zbMath0890.90101DBLPjournals/orl/KovalyovW97WikidataQ57633983 ScholiaQ57633983MaRDI QIDQ1376266
Mikhail Y. Kovalyov, Frank Werner
Publication date: 6 July 1998
Published in: Operations Research Letters (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (4)
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times ⋮ Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. ⋮ Polynomial-time approximation schemes for scheduling problems with time lags ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal two- and three-stage production schedules with setup times included
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Combinatorial Problems: Reductibility and Approximation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
This page was built for publication: A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
