An Optimal Online Algorithm for Scheduling with Learning Consideration

DOI10.1142/S0217595921400029zbMath1481.90181OpenAlexW3121872118MaRDI QIDQ5024474

Wenwen Han, Ran Ma, Juan Zou, Cuixia Miao

Publication date: 1 February 2022

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595921400029

zbMATH Keywords

schedulingcompetitive ratioonline algorithmlearning effect

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (1)

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

Cites Work

• Several flow shop scheduling problems with truncated position-based learning effect
• An order scheduling problem with position-based learning effect
• Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Single-machine scheduling problems with a learning effect
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• Single-machine scheduling with learning considerations
• Single-machine rescheduling problems with learning effect under disruptions
• Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning
• Scheduling with general job-dependent learning curves.
• Simple matching vs linear assignment in scheduling models with positional effects: a critical review
• Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
• Online scheduling to minimize the total weighted completion time plus the rejection cost
• Scheduling with a position-weighted learning effect
• A state-of-the-art review on scheduling with learning effects
• A new approach to the learning effect: Beyond the learning curve restrictions
• Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
• Flow-shop scheduling with a learning effect
• SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
• Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times
• Optimal on-line algorithms for single-machine scheduling
• Research on m‐machine flow shop scheduling with truncated learning effects

This page was built for publication: An Optimal Online Algorithm for Scheduling with Learning Consideration