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

Full description

Bibliographic Details

Published in:	International journal of production research Vol. 62; no. 19; pp. 6933 - 6940
Main Authors:	Mor, Baruch, Mosheiov, Gur
Format:	Journal Article
Language:	English
Published:	Taylor & Francis 01.10.2024
Subjects:	dynamic programming algorithm makespan parallel dedicated machines Scheduling total completion time total load
ISSN:	0020-7543, 1366-588X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!