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