Online early work scheduling on parallel machines

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Semi-online scheduling on two identical machines with a common due date to maximize total early work
Open shop scheduling problems with late work criteria.
On-line scheduling revisited
Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
Scheduling on parallel identical machines with late work criterion: offline and online cases
Online scheduling of ordered flow shops
Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
Minimizing total late work on a single machine with generalized due-dates
Competitive algorithm for scheduling of sharing machines with rental discount
A common approximation framework for early work, late work, and resource leveling problems
Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
Semi-online scheduling: a survey
Single Machine Scheduling to Minimize Total Late Work
Online scheduling on parallel machines: A survey
Bounds for Certain Multiprocessing Anomalies
Parallel solutions for preemptive makespan scheduling on two identical machines
Machine covering in the random-order model
Online load balancing on uniform machines with limited migration
Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
Single machine scheduling with assignable due dates to minimize maximum and total late work
Online cardinality constrained scheduling
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms

This page was built for publication: Online early work scheduling on parallel machines