@inproceedings{8f773c6de0fe4f62b8aa2e8cb55e5887,
title = "General optimization schemes for scheduling unrelated machines with rejection",
abstract = "In classical scheduling problems, it is assumed that all the jobs have to be processed in the shop. However, in many practical cases, the scheduler may wish to process some jobs by outsourcing them or may reject them altogether. Some general schemes for solving problems of scheduling unrelated parallel machines with job rejection are suggested. These schemes provide unified pseudo-polynomial time solution methods for many NP-hard scheduling problems that share two common properties - their scheduling criterion is regular, and it is possible to index the jobs such that in an optimal schedule the jobs assigned to a given machine are schedule in the order of their indices.",
keywords = "Pseudo-polynomial time algorithm, Rejection, Scheduling, Unrelated parallel machines",
author = "D. Shabtay and N. Gaspar and M. Kaspi",
year = "2011",
month = jan,
day = "1",
language = "English",
series = "21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings",
publisher = "Fraunhofer-Verlag",
editor = "Tobias Krause and Dieter Spath and Rolf Ilg",
booktitle = "21st International Conference on Production Research",
note = "21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 ; Conference date: 31-07-2011 Through 04-08-2011",
}