Single-machine scheduling with trade-off between number of tardy jobs and compression cost

We consider a single-machine scheduling problem, in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem, where no tardy jobs are allowed and the objective is to minimize the total compression...

Full description

Bibliographic Details

Published in:	Journal of scheduling Vol. 10; no. 4-5; pp. 303 - 310
Main Authors:	He, Yong, Wei, Qi, Cheng, T. C. E.
Format:	Journal Article
Language:	English
Published:	New York Springer Nature B.V 01.10.2007
Subjects:	Algorithms Costs Employment Job shops Linear programming Scheduling Studies
ISSN:	1094-6136, 1099-1425
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!