๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On a single-machine optimal constant due-date assignment and sequencing problem

โœ Scribed by TCE Cheng

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
164 KB
Volume
1
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper considers the problem of optimal constant due-date assignment and sequencing of jobs in a single-machine shop. We formulate the problem as a general constrained optimization problem and apply the Kuhn-Tucker conditions to find the optimal solution which is shown to be independent of the job sequence.

๐Ÿ“œ SIMILAR VOLUMES

Optimal assignment of slack due-dates an
Optimal assignment of slack due-dates and sequencing in a single-machine shop
โœ T.C.E. Cheng ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 194 KB

This paper considers the problem of optimal assignment of slack due-dates to n jobs and sequencing them on a single-machine to minimize a penalty function depending on the values of the assigned slack allowance and maximum job tardiness. It is shown that the earliest due-date order yields an optimal