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

Optimal due-date assignment for a single machine sequencing problem with random processing times

โœ Scribed by CHENG, T. C. E.

Book ID
126485963
Publisher
Taylor and Francis Group
Year
1986
Tongue
English
Weight
206 KB
Volume
17
Category
Article
ISSN
0020-7721

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Due-date assignment and single machine s
Due-date assignment and single machine scheduling with compressible processing times
โœ T.C.E. Cheng; C. Oวงuz; X.D. Qi ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 588 KB

In this paper we consider a due-date assignment and single machine scheduling problem in which the jobs have compressible processing times. Two models are defined according to the due-date assignment methods used. The first model applies the common (constant) due-date assignment method to assign the