Semi-online scheduling on two uniform parallel machines with initial lookahead
From MaRDI portal
Publication:6594037
DOI10.1051/RO/2024042zbMATH Open1546.90066MaRDI QIDQ6594037
Could not fetch data.
Publication date: 27 August 2024
Published in: RAIRO. Operations Research (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semi-online scheduling problems on two uniform machines under a grade of service provision
- Lower bounds for online makespan minimization on a small number of related machines
- Semi-online scheduling on two uniform machines with the known largest size
- Online scheduling with rearrangement on two related machines
- Online and semi-online hierarchical scheduling for load balancing on uniform machines
- Competitive ratio of list scheduling on uniform machines and randomized heuristics
- Scheduling unit length jobs on parallel machines with lookahead information
- A new algorithm for online uniform-machine scheduling to minimize the makespan
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
- Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines
- Online and semi-online scheduling of two machines under a grade of service provision
- Online scheduling of unit jobs on three machines with rejection: a tight result
- Two semi-online scheduling problems on two uniform machines
- Online scheduling on two uniform machines to minimize the makespan
- A survey on makespan minimization in semi-online environments
- General parametric scheme for the online uniform machine scheduling problem with two different speeds
- Online makespan scheduling with job migration on uniform machines
- Online machine minimization with lookahead
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
- Online scheduling of incompatible unit-length job families with lookahead
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
- Online fractional hierarchical scheduling on uniformly related machines
- Rejecting jobs to minimize load and maximum flow-time
- Online interval scheduling on two related machines: the power of lookahead
- Semi-online scheduling on two uniform processors
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
- 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
- Bounds for List Schedules on Uniform Processors
- An On-Line Algorithm for Some Uniform Processor Scheduling
- A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
- Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead
- Bounds for Certain Multiprocessing Anomalies
- Randomized on-line scheduling on two uniform machines
- Semi-online scheduling on two identical parallel machines with initial-lookahead information
This page was built for publication: Semi-online scheduling on two uniform parallel machines with initial lookahead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6594037)
