Online scheduling on unbounded parallel-batch machines to minimize the makespan
From MaRDI portal
Publication:990962
DOI10.1016/j.ipl.2009.08.008zbMath1206.68072OpenAlexW2009153149MaRDI QIDQ990962
Publication date: 1 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.08.008
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items
Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart ⋮ Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine ⋮ A best possible on-line algorithm for scheduling on uniform parallel-batch machines ⋮ Online scheduling on bounded batch machines to minimize the maximum weighted completion time ⋮ A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES ⋮ Online scheduling with delivery time on a bounded parallel batch machine with limited restart ⋮ Research on the parallel-batch scheduling with linearly lookahead model ⋮ Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval ⋮ Online scheduling of jobs with kind release times and deadlines on a single machine ⋮ Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions ⋮ Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead ⋮ Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time ⋮ An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times ⋮ Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time ⋮ Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan ⋮ Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ The medical laboratory scheduling for weighted flow-time ⋮ Online batch scheduling with kind release times and incompatible families to minimize makespan ⋮ Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart ⋮ Online scheduling on unbounded parallel-batch machines with incompatible job families ⋮ A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints ⋮ Online batch scheduling on parallel machines with delivery times ⋮ Revisit of the scheduling problems with integrated production and delivery on parallel batching machines ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan ⋮ Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead ⋮ Online scheduling of two-machine flowshop with lookahead and incompatible job families ⋮ Online unbounded batch scheduling on parallel machines with delivery times
Cites Work
- Unnamed Item
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
- A best online algorithm for scheduling on two parallel batch machines
- Scheduling a batching machine
- Approximation algorithms in batch processing
- Scheduling one batch processor subject to job release dates
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- On-line scheduling algorithms for a batch machine with finite capacity
- On-line algorithms for minimizing makespan on batch processing machines
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Control of a batch-processing machine: A computational approach
This page was built for publication: Online scheduling on unbounded parallel-batch machines to minimize the makespan
