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

Two-agent scheduling to minimize the total cost

โœ Scribed by Q.Q. Nong; T.C.E. Cheng; C.T. Ng


Book ID
113583693
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
238 KB
Volume
215
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Scheduling to minimize the total compres
โœ T.C.E. Cheng; Zhi-Long Chen; Chung-Lun Li; B.M.-T. Lin ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 101 KB

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be