A best possible algorithm for an online scheduling problem with position-based learning effect
From MaRDI portal
Publication:2171076
DOI10.3934/jimo.2021144OpenAlexW3197631028MaRDI QIDQ2171076
Lu Zhang, Ran Ma, Yu-Zhong Zhang
Publication date: 23 September 2022
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2021144
Cites Work
- Unnamed Item
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
- Note on ``A note on single-machine group scheduling problems with position-based learning effect
- A note on single-machine group scheduling problems with position-based learning effect
- On-line scheduling of parallel machines to minimize total completion times
- Single-machine scheduling with learning considerations
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
- Single-machine rescheduling problems with learning effect under disruptions
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects
- A state-of-the-art review on scheduling with learning effects
- Flow-shop scheduling with a learning effect
- Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
- Optimal on-line algorithms for single-machine scheduling
- Scheduling with a position-weighted learning effect and job release dates
- Scheduling problems with a learning effect
