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

Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties

โœ Scribed by Cheng, T. C. Edwin; Kovalyov, Mikhail Y.; Lin, Bertrand M. T.


Book ID
118205133
Publisher
Society for Industrial and Applied Mathematics
Year
1997
Tongue
English
Weight
311 KB
Volume
7
Category
Article
ISSN
1052-6234

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Scheduling a single machine to minimize
โœ 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