On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
From MaRDI portal
Publication:835640
DOI10.1007/s10951-008-0084-6zbMath1176.68246OpenAlexW2068498891MaRDI QIDQ835640
Jinjiang Yuan, Ruyan Fu, Ji Tian
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0084-6
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (12)
Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval ⋮ An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts ⋮ Batch machine production with perishability time windows and limited batch size ⋮ Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs ⋮ An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility ⋮ Online batch scheduling with kind release times and incompatible families to minimize makespan ⋮ Online scheduling of incompatible unit-length job families with lookahead ⋮ Online scheduling on unbounded parallel-batch machines with incompatible job families ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan ⋮ Online scheduling of two-machine flowshop with lookahead and incompatible job families
Cites Work
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
- On-line scheduling on a batch machine to minimize makespan with limited restarts
- Scheduling a batching machine
- Approximation algorithms in batch processing
- On-line scheduling algorithms for a batch machine with finite capacity
- Minimizing makespan in batch machine scheduling
- Scheduling with batching: A review
- On-line algorithms for minimizing makespan on batch processing machines
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling batch processing machines with incompatible job families
This page was built for publication: On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
