.png){kind=icon}
.png){kind=icon}
Return
Minmax due-date assignment on a two-machine flowshop
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-021-04212-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We extend two classical scheduling and due-date assignment models. In the first (known in the literature as DIF), due-dates are determined by penalties for exceeding pre-specified deadlines. In the second (known as SLK), due-dates are assigned to jobs as a (linear) function of their processing times. We focus on the minmax versions of these models, and extend the single machine versions to a two-machine flowshop. We further extend the settings to that of a due-window. All the problems studied in this note are shown to have polynomial time solutions.
Keywords:
Scheduling
Two-machine flowshop
Due-date 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:
4.5
Papers:
8.0K
Citations:
2.1W