.png){kind=icon}
Return
Single-machine scheduling problems with time and position dependent processing times
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-011-0835-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider single-machine scheduling problems with time and position dependent job processing times. In many industrial settings, the processing time of a job changes due to either job deterioration over time or machine/worker's learning through experiences. In the models we study, each job has its normal processing time. However, a job's actual processing time depends on when its processing starts and how many jobs have completed before its start. We prove that the classical SPT (Shortest Processing Time) rule remains optimal when we minimize the makespan or the total completion time. For problems of minimizing the total weighted completion time, the maximum lateness, and the discounted total weighted completion time, we present heuristic sequencing rules and analyze the worst-case bounds for performance ratios. We also show that these heuristic rules can be optimal under some agreeable conditions between the normal processing times and job due dates or weights.
Keywords:
Single-machine scheduling
Learning effect
Performance ratio
Worst-case error
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
Cited Papers
.png){kind=icon}
ShareSave
Third-order exceptional point and successive switching among three states in an optical microcavity
OAAI
OAAIShareSaveShareSave
View more