A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
From MaRDI portal
Publication:6181379
DOI10.1007/s11590-022-01966-7OpenAlexW4318982564MaRDI QIDQ6181379
Ran Ma, Yu-Zhong Zhang, Juannian Xu
Publication date: 22 January 2024
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-022-01966-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- Automatic algorithm design for hybrid flowshop scheduling problems
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems
- Non-clairvoyantly scheduling to minimize convex functions
- A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
- Speed is as powerful as clairvoyance
- Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
- Optimal on-line algorithms for single-machine scheduling
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
- Algorithms for minimizing weighted flow time
- Rejecting jobs to Minimize Load and Maximum Flow-time
- Online Scheduling with General Cost Functions
- Optimal time-critical scheduling via resource augmentation
This page was built for publication: A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
