Online scheduling on a single machine with linear deteriorating processing times and delivery times
From MaRDI portal
Publication:2082204
DOI10.1007/s10878-020-00557-5zbMath1502.90070OpenAlexW3009065144MaRDI QIDQ2082204
Hang Yuan, Wenhua Li, Libo Wang, Xing Chai
Publication date: 4 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00557-5
Related Items (2)
Adaptive online portfolio strategy based on exponential gradient updates ⋮ Online economic ordering problem for deteriorating items with limited price information
Cites Work
- Unnamed Item
- Unnamed Item
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
- Optimal algorithms for online single machine scheduling with deteriorating jobs
- Online over time scheduling on parallel-batch machines: a survey
- Online batch scheduling on parallel machines with delivery times
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- On-line scheduling with delivery time on a single batch machine
- Scheduling jobs under simple linear deterioration
- A concise survey of scheduling with time-dependent processing times
- Online unbounded batch scheduling on parallel machines with delivery times
- Online scheduling on two parallel machines with release dates and delivery times
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs
This page was built for publication: Online scheduling on a single machine with linear deteriorating processing times and delivery times
