Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
From MaRDI portal
Publication:436585
DOI10.1016/j.ipl.2012.03.015zbMath1243.68115OpenAlexW2025916581MaRDI QIDQ436585
Jinjiang Yuan, Hailing Liu, Zhen-Kun Zhang, Wen-Jie Li
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.015
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (4)
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery ⋮ Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- 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
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- On-line algorithms for minimizing makespan on batch processing machines
- Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs
- Online Scheduling of Bounded Length Jobs to Maximize Throughput
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
This page was built for publication: Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
