.png){kind=icon}
Return
OPTIMAL DUE-DATE ASSIGNMENT AND SEQUENCING
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(92)90343-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper examines the problem of assigning due-dates to a given set of jobs and sequencing them on a single machine in order to minimize the cost of quoting long due-dates and that of missing the quoted due-dates. Properties required for the solution of the problem are identified, leading to the recognition that the problem is computationally difficult. It is shown, however, that there are special cases of the problem which can be solved easily. Viable solution strategies for the general problem, both exact and approximate, are also proposed.
Keywords:
SCHEDULING
MATHEMATICAL PROGRAMMING
APPROXIMATION SCHEME
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
ShareSaveShareSave
View more