Scheduling on parallel dedicated machines with job rejection

We study scheduling problems on parallel dedicated machines. Thus, each job can be processed on one specific machine only. The option of job-rejection is considered, and the total permitted rejection cost of all the jobs is bounded. Six scheduling problems are solved: ( $ i $ i ) minimising makespan...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of production research Ročník 62; číslo 19; s. 6933 - 6940
Hlavní autori:	Mor, Baruch, Mosheiov, Gur
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Taylor & Francis 01.10.2024
Predmet:	dynamic programming algorithm makespan parallel dedicated machines Scheduling total completion time total load
ISSN:	0020-7543, 1366-588X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!