.png){kind=icon}
Return
SINGLE-MACHINE SEQUENCING WITH CONTROLLABLE PROCESSING TIMES
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(92)90144-X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a static single-machine sequencing problem in which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containing earliness cost, tardiness costs, and total processing cost.
Keywords:
SCHEDULING
DUE DATE ASSIGNMENT
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
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave no more
no more