An optimal online algorithm for single-processor scheduling problem with learning effect
type: Item
instance of: scholarly article
title: An optimal online algorithm for single-processor scheduling problem with learning effect
author: Ran Ma
author: Sainan Guo
author: Xiaoyan Zhang
published in: Theoretical Computer Science
publication date: 2022-10-07T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7597572
zbMATH Keywords: scheduling
zbMATH Keywords: online algorithm
zbMATH Keywords: learning effect
zbMATH Keywords: position-based
zbMATH Keywords: single processor
MaRDI profile type: Publication
full work available at URL: j.tcs.2022.06.006
OpenAlex ID: W4281917512
cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
cites work: Single-machine scheduling with learning considerations
cites work: A state-of-the-art review on scheduling with learning effects
cites work: Online scheduling of jobs with favorite machines
cites work: Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
cites work: Scheduling with a position-weighted learning effect
cites work: LP-based online scheduling: From single to parallel machines
cites work: Algorithms for minimizing weighted flow time
cites work: Q4658190
cites work: Flow Shop Scheduling with Partial Resource Flexibility
cites work: Online algorithms. The state of the art
cites work: Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Optimal on-line algorithms for single-machine scheduling
cites work: Online scheduling of ordered flow shops
cites work: Scheduling problems with general effects of deterioration and learning
cites work: Optimal algorithms for online single machine scheduling with deteriorating jobs
cites work: A class of on-line scheduling algorithms to minimize total completion time
cites work: Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection
cites work: An Optimal Online Algorithm for Scheduling with Learning Consideration
cites work: An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
cites work: Scheduling problems with a learning effect
cites work: Tight Bounds for Permutation Flow Shop Scheduling
cites work: Minimizing average completion time in the presence of release dates
cites work: Q4368485
cites work: Flow-shop scheduling with a learning effect
cites work: Single-machine scheduling problems with a learning effect
cites work: Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
cites work: An order scheduling problem with position-based learning effect
cites work: Online scheduling of moldable parallel tasks
cites work: Machine scheduling with soft precedence constraints
DOI: 10.1016/J.TCS.2022.06.006
description: scientific article; zbMATH DE number 7597572