A linear time approximation scheme for makespan minimization in an open shop with release dates
From MaRDI portal
Publication:1866011
DOI10.1016/S0167-6377(02)00115-3zbMath1049.90027MaRDI QIDQ1866011
Alexander V. Kononov, M. I. Sviridenko
Publication date: 3 April 2003
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) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Approximability of flow shop scheduling
- Makespan minimization in open shops: A polynomial time approximation scheme
- Approximation algorithms for the multiprocessor open shop scheduling problem
- On-line scheduling of two-machine open shops where jobs arrive over time
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Open Shop Scheduling to Minimize Finish Time
- Short Shop Schedules
- Linear time approximation scheme for the multiprocessor open shop problem
This page was built for publication: A linear time approximation scheme for makespan minimization in an open shop with release dates