.png){kind=icon}
Return
Single machine scheduling problems with exponentially time-dependent learning effects
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jmsy.2014.11.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we introduce a single-machine scheduling problem with an exponentially time-dependent learning effect. The processing time of a job is assumed to be an exponential function of the total normal processing time of jobs already processed before it. For such a scheduling problem, we first provide the upper bound for the maximum lateness and for the total weighted completion time. Next, we show that problems with the following criteria: makespan, the total completion time, the total weighted completion time, the total earliness/tardiness penalties and the maximum lateness under some agreeable conditions, are polynomially solvable. (C) 2014 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Time-dependent
Learning effect
Upper bound
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
14.2
Papers:
2.7K
Citations:
1.6W
Organization
Cited Papers
ShareSaveAsking about trauma: the experiences of psychological therapists in early intervention services.png)
Psychosis
PsychosisIF0
PREAI
ShareSaveHope for Help-Seeking: A Positive Psychology Perspective of Psychological Help-Seeking Intentions
PREAI
ShareSaveShareSave
View more