Online scheduling on two parallel machines with release dates and delivery times

Recommendations

Cites work

`` Strong NP-Completeness Results
A best on-line algorithm for single machine scheduling with small delivery times
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
An optimal online algorithm for scheduling two machines with release times
An optimal online algorithm for single machine scheduling with bounded delivery times
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
Efficient approximation schemes for scheduling problems with release dates and delivery times
Heuristics for parallel machine scheduling with delivery times
Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
Lower bounds for scheduling on identical parallel machines with heads and tails
Minimizing makespan on parallel machines subject to release dates and delivery times
Online unbounded batch scheduling on parallel machines with delivery times
Randomized algorithms for on-line scheduling problems: How low can't you go?
Randomized online scheduling with delivery times
Scheduling jobs with release dates and tails on identical machines to minimize the makespan
Scheduling on identical machines: How good is LPT in an on-line setting?
Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times

Cited in

(8)

This page was built for publication: Online scheduling on two parallel machines with release dates and delivery times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355989)