Semi-online scheduling on two identical parallel machines with initial-lookahead information
DOI10.1142/S0217595923500033zbMATH Open1542.90128MaRDI QIDQ6561561FDOQ6561561
Authors: Feifeng Zheng, Yuhong Chen, Ming Liu, Yinfeng Xu 
Publication date: 25 June 2024
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
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
competitive ratiovalue of informationparallel machine schedulingsemi-online algorithminitial lookahead
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)
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
- Online-list scheduling on a single bounded parallel-batch machine to minimize makespan
- 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
- A study of online berth and quay crane integrated allocation problem with lookahead ability
Cited In (1)
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)
