Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
From MaRDI portal
Publication:829170
DOI10.1007/s10479-019-03352-6OpenAlexW2968713904MaRDI QIDQ829170
Xing Chai, Yuejuan Zhu, Wenhua Li
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03352-6
Algorithms in computer science (68Wxx) Mathematical programming (90Cxx) Theory of computing (68Qxx) Operations research and management science (90Bxx)
Related Items
Cites Work
- Unnamed Item
- An optimal online algorithm for single machine scheduling to minimize total general completion time
- Online over time scheduling on parallel-batch machines: a survey
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
- A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
- Online weighted flow time and deadline scheduling
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- Scheduling a batching machine
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- A note on special optimal batching structures to minimize total weighted completion time
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line algorithms for minimizing makespan on batch processing machines
- A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
- Minimizing weighted flow time
- Algorithms for minimizing weighted flow time
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- Makespan minimization in online scheduling with machine eligibility