Semi-online scheduling on two identical parallel machines with initial-lookahead information

Cites Work

Title not available (Why is that?)
Semi-online scheduling revisited
Semi-on-line multiprocessor scheduling with given total processing time
Bounds for Certain Multiprocessing Anomalies
Bounds on Multiprocessing Timing Anomalies
Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
Online interval scheduling on two related machines: the power of lookahead
An improved online algorithm for the online preemptive scheduling of equal-length intervals on a single machine with lookahead
Online interval scheduling on a single machine with finite lookahead
Scheduling unit length jobs on parallel machines with lookahead information
Semi on-line scheduling on three processors with known sum of the tasks
Title not available (Why is that?)
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
A survey on makespan minimization in semi-online environments
Scheduling on parallel identical machines with late work criterion: offline and online cases
Makespan minimization in online scheduling with machine eligibility
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
Online scheduling of incompatible unit-length job families with lookahead
Optimal online algorithms for MapReduce scheduling on two uniform machines
New results on competitive analysis of online SRPT scheduling
Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead
Online machine minimization with lookahead
Research on the parallel-batch scheduling with linearly lookahead model
Semi-online scheduling: a survey
Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead
Title not available (Why is that?)

Cited In (1)

Semi-online scheduling on two uniform parallel machines with initial lookahead

This page was built for publication: Semi-online scheduling on two identical parallel machines with initial-lookahead information

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