.png){kind=icon}
Return
Machine scheduling with DeJong's learning effect
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2014.12.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a relatively new learning model in scheduling based on DeJong's learning effect. Compared with the classical learning model for scheduling, this model is more general and realistic. The objectives are to minimize makespan and total completion time. For the single-machine case, we show that both of the objectives are polynomially solvable. For the parallel-machine case, we show that minimizing total completion time is still polynomially solvable, while minimizing makespan is NP-hard, for which we provide a fully polynomial-time approximation scheme (FPTAS). (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
DeJong's learning effect
Makespan
Total completion time
FPTAS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
Cited Papers
ShareSaveExploring state-level variabilities between perceived community resilience and posttraumatic stress symptoms during the COVID-19 pandemic: Multilevel modeling approach..png)
Traumatology
TraumatologyIF0
PREAI
ShareSave
ShareSaveAsking about trauma: the experiences of psychological therapists in early intervention servicesPsychosis
PsychosisIF0
PREAI
ShareSave
View more