General optimization schemes for scheduling unrelated machines with rejection

D. Shabtay, N. Gaspar, M. Kaspi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageAmerican English
Title of host publication21st International Conference on Production Research
Subtitle of host publicationInnovation in Product and Production, ICPR 2011 - Conference Proceedings
EditorsTobias Krause, Dieter Spath, Rolf Ilg
ISBN (Electronic)9783839602935
StatePublished - 1 Jan 2011
Event21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Stuttgart, Germany
Duration: 31 Jul 20114 Aug 2011

Publication series

Name21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings

Conference

Conference21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011
Country/TerritoryGermany
CityStuttgart
Period31/07/114/08/11

Keywords

  • Pseudo-polynomial time algorithm
  • Rejection
  • Scheduling
  • Unrelated parallel machines

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'General optimization schemes for scheduling unrelated machines with rejection'. Together they form a unique fingerprint.

Cite this