.png){kind=icon}
Return
Minmax scheduling problems with a common due-window
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2008.06.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper focuses on a minmax due-window assignment problem. The goal is to schedule the jobs and the due-window such that the highest cost among all jobs is minimized. The objective function contains four cost components: for earliness, tardiness, due-window starting time and due-window size. We present a polynomial time solution for the case of a single machine and for a two-machine flow-shop. The cases of parallel identical machines and uniform machines are NP-hard, and simple heuristics and lower bounds are introduced and tested numerically.
Keywords:
Scheduling
Earliness-tardiness
Common due-window
Minmax
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveDiverse regulatory activity of human heat shock proteins 60 and 70 on endotoxin-induced inflammation
PREAI
ShareSaveShareSave
ShareSave no more
no more