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

Optimal schedule on a single machine using various due date determination methods

โœ Scribed by Y.P. Gupta; C.R. Bector; M.C. Gupta

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
674 KB
Volume
15
Category
Article
ISSN
0166-3615

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling a single machine to minimize
Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
โœ Xiangton Qi; Feng-Sheng Tu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 404 KB

This paper considers a single machine scheduling problem. There are n jobs to be processed on a single machine. The problem is to minimize total earliness penalties subject to no tardy jobs. The problem is NP-complete if the due-dates are arbitrary. We study the problem when the due-dates are determ

On a single-machine optimal constant due
On a single-machine optimal constant due-date assignment and sequencing problem
โœ TCE Cheng ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 164 KB

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 j