.png){kind=icon}
.png){kind=icon}
Return
Parallel machine scheduling problems with common flow-allowance
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2012.06.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In due-date assignment problems with a common flow-allowance, the job-dependent due-dates are determined as linear functions of the job processing times. This paper studies due-date and due-window assignment problems based on flow-allowance with a minmax objective function. We consider a setting of parallel identical machines. The problems are proved to be NP-hard, and efficient heuristic procedures and simple lower bounds are introduced. Worst case analysis is provided in both cases. Our numerical tests indicate that the heuristics produce extremely close-to-optimal schedules. Our procedures (heuristics and bounds) are extended to parallel uniform machines, and based on our numerical tests, the average optimality gaps remain very small. (c) 2012 Elsevier B.V. All rights reserved.
Keywords:
Scheduling
Parallel identical machines
Uniform machines
Flow-allowance
Due-date assignment
Due-window assignment
Minmax
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10
Papers:
7.9K
Citations:
3.6W