Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
From MaRDI portal
Publication:3082645
DOI10.1080/00207720903428906zbMath1207.90052OpenAlexW1970915793MaRDI QIDQ3082645
Hailin Bu, Jianfa Cao, Jinjiang Yuan, Wen-Jie Li
Publication date: 16 March 2011
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207720903428906
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items
Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine ⋮ Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine ⋮ Online scheduling on bounded batch machines to minimize the maximum weighted completion time ⋮ Minimising makespan for two batch-processing machines with non-identical job sizes in job shop ⋮ The medical laboratory scheduling for weighted flow-time ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan ⋮ Online algorithms to schedule a proportionate flexible flow shop of batching machines ⋮ Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
Cites Work
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
- Scheduling a batching machine
- On-line scheduling a batch processing system to minimize total weighted job completion time
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Single machine parallel batch scheduling subject to precedence constraints
