An optimal online algorithm for single-processor scheduling problem with learning effect

DOI10.1016/j.tcs.2022.06.006MaRDI QIDQ2079858

Xiaoyan Zhang, Sainan Guo, Ran Ma

Publication date: 7 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.06.006

zbMATH Keywords

scheduling; online algorithm; learning effect; single processor; position-based

Mathematics Subject Classification ID

68Qxx: Theory of computing

Cites Work

• Unnamed Item
• Unnamed Item
• An order scheduling problem with position-based learning effect
• Optimal algorithms for online single machine scheduling with deteriorating jobs
• Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
• Scheduling problems with general effects of deterioration and learning
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• LP-based online scheduling: From single to parallel machines
• Single-machine scheduling problems with a learning effect
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• Online algorithms. The state of the art
• Single-machine scheduling with learning considerations
• Minimizing average completion time in the presence of release dates
• An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
• A class of on-line scheduling algorithms to minimize total completion time
• Online scheduling of ordered flow shops
• Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
• Machine scheduling with soft precedence constraints
• Online scheduling of jobs with favorite machines
• Online scheduling of moldable parallel tasks
• Scheduling with a position-weighted learning effect
• A state-of-the-art review on scheduling with learning effects
• Flow Shop Scheduling with Partial Resource Flexibility
• Flow-shop scheduling with a learning effect
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal on-line algorithms for single-machine scheduling
• An Optimal Online Algorithm for Scheduling with Learning Consideration
• Algorithms for minimizing weighted flow time
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Tight Bounds for Permutation Flow Shop Scheduling
• Scheduling problems with a learning effect