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

Scheduling problems with multiple due windows assignment and controllable processing times on a single machine

โœ Scribed by Yang, Dar-Li; Lai, Chien-Jung; Yang, Suh-Jenq


Book ID
125417839
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
300 KB
Volume
150
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Due-date assignment and single machine s
โœ 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