Online scheduling on unbounded parallel-batch machines to minimize the makespan
From MaRDI portal
Publication:990962
DOI10.1016/J.IPL.2009.08.008zbMATH Open1206.68072OpenAlexW2009153149MaRDI QIDQ990962FDOQ990962
Authors: J. Martínez 
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
Recommendations
- Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Scheduling a batching machine
- Scheduling one batch processor subject to job release dates
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Title not available (Why is that?)
- A best online algorithm for scheduling on two parallel batch machines
- Approximation algorithms in batch processing
- 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
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
- Control of a batch-processing machine: A computational approach
Cited In (37)
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- Lower bounds for online makespan minimization on a small number of related machines
- Online makespan minimization with budgeted uncertainty
- Online scheduling of two-machine flowshop with lookahead and incompatible job families
- Online unbounded batch scheduling on parallel machines with delivery times
- The medical laboratory scheduling for weighted flow-time
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
- Online batch scheduling with kind release times and incompatible families to minimize makespan
- A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
- Online over time scheduling on parallel-batch machines: a survey
- Online Makespan Scheduling with Job Migration on Uniform Machines
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
- Title not available (Why is that?)
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines
- Online scheduling of parallel jobs with bounded processing times on two machines
- Revisit of the scheduling problems with integrated production and delivery on parallel batching machines
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- Online minimum makespan scheduling with a buffer
- 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 on an unbounded parallel-batch machine and a standard machine to minimize makespan
- Online scheduling with delivery time on a bounded parallel batch machine with limited restart
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead
- Online makespan scheduling with job migration on uniform machines
- Research on the parallel-batch scheduling with linearly lookahead model
- Online scheduling on unbounded parallel-batch machines with incompatible job families
- Online batch scheduling on parallel machines with delivery times
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
- Online scheduling of jobs with kind release times and deadlines on a single machine
This page was built for publication: Online scheduling on unbounded parallel-batch machines to minimize the makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990962)
