An optimal online algorithm for scheduling with learning consideration
From MaRDI portal
(Redirected from Publication:5024474)
Recommendations
- A best possible algorithm for an online scheduling problem with position-based learning effect
- An optimal online algorithm for single machine scheduling to minimize total general completion time
- Single-machine scheduling with learning considerations
- Minimizing the total completion time in a single-machine scheduling problem with a learning effect
- The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
Cites work
- A new approach to the learning effect: Beyond the learning curve restrictions
- A state-of-the-art review on scheduling with learning effects
- An order scheduling problem with position-based learning effect
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Flow-shop scheduling with a learning effect
- Online scheduling to minimize the total weighted completion time plus the rejection cost
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Optimal on-line algorithms for single-machine scheduling
- Research on m‐machine flow shop scheduling with truncated learning effects
- Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Scheduling with a position-weighted learning effect
- Scheduling with general job-dependent learning curves.
- Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning
- Several flow shop scheduling problems with truncated position-based learning effect
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- Single-machine rescheduling problems with learning effect under disruptions
- Single-machine scheduling problems with a learning effect
- Single-machine scheduling with learning considerations
- Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
Cited in
(5)- An optimal online algorithm for single-processor scheduling problem with learning effect
- A best possible algorithm for an online scheduling problem with position-based learning effect
- Optimal preemptive algorithm for parallel machine scheduling with learning effect in cloud manufacturing
- Online Scheduling via Learned Weights
- Machine learning-based online scheduling in distributed computing
This page was built for publication: An optimal online algorithm for scheduling with learning consideration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024474)
