Online Scheduling on Two Parallel Machines with Release Times and Delivery Times
From MaRDI portal
Publication:2867111
DOI10.1007/978-3-319-03780-6_9zbMath1407.90164OpenAlexW2404565765MaRDI QIDQ2867111
Publication date: 10 December 2013
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_9
Deterministic scheduling theory in operations research (90B35) Logic in artificial intelligence (68T27)
Cites Work
- Unnamed Item
- Lower bounds for scheduling on identical parallel machines with heads and tails
- An optimal online algorithm for single machine scheduling with bounded delivery times
- A block approach for single-machine scheduling with release dates and due dates
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Heuristics for parallel machine scheduling with delivery times
- Scheduling on identical machines: How good is LPT in an on-line setting?
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Randomized algorithms for on-line scheduling problems: How low can't you go?
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- A best on-line algorithm for single machine scheduling with small delivery times
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- `` Strong NP-Completeness Results
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- An optimal online algorithm for scheduling two machines with release times
This page was built for publication: Online Scheduling on Two Parallel Machines with Release Times and Delivery Times
