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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of scheduling Ročník 10; číslo 4-5; s. 303 - 310
Hlavní autori:	He, Yong, Wei, Qi, Cheng, T. C. E.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer Nature B.V 01.10.2007
Predmet:	Algorithms Costs Employment Job shops Linear programming Scheduling Studies
ISSN:	1094-6136, 1099-1425
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!