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

Recommendations

Semi-online scheduling on two uniform parallel machines with initial lookahead
Scheduling unit length jobs on parallel machines with lookahead information
Semi-online scheduling problems on a small number of machines
Semi-online scheduling: a survey
Semi-online scheduling with combined information on two identical machines in parallel

Cites Work

scientific article; zbMATH DE number 1232130 (Why is no real title available?)
A study of online berth and quay crane integrated allocation problem with lookahead ability
A survey on makespan minimization in semi-online environments
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
An improved online algorithm for the online preemptive scheduling of equal-length intervals on a single machine with lookahead
Bounds for Certain Multiprocessing Anomalies
Bounds on Multiprocessing Timing Anomalies
Makespan minimization in online scheduling with machine eligibility
New results on competitive analysis of online SRPT scheduling
Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead
Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead
Online interval scheduling on a single machine with finite lookahead
Online interval scheduling on two related machines: the power of lookahead
Online machine minimization with lookahead
Online scheduling of incompatible unit-length job families with lookahead
Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
Online-list scheduling on a single bounded parallel-batch machine to minimize makespan
Optimal online algorithms for MapReduce scheduling on two uniform machines
Research on the parallel-batch scheduling with linearly lookahead model
Scheduling on parallel identical machines with late work criterion: offline and online cases
Scheduling unit length jobs on parallel machines with lookahead information
Semi on-line scheduling on three processors with known sum of the tasks
Semi-on-line multiprocessor scheduling with given total processing time
Semi-online scheduling revisited
Semi-online scheduling: a survey
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum

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)