Scheduling with processing set restrictions: A survey

Document Type

Article

Publication Date

12-1-2008

Abstract

Scheduling problems with processing set restrictions have been studied extensively by computer scientists and operations researchers under different names. These include "scheduling typed task systems," "multi-purpose machine scheduling," "scheduling with eligibility constraints," "scheduling with processing set restrictions," and "semi-matchings for bipartite graphs." In this paper we survey the state of the art of these problems. Our survey covers offline and online problems, as well as nonpreemptive and preemptive scheduling environments. Our emphasis is on polynomial-time algorithms, complexity issues, and approximation schemes. While our main focus is on the makespan objective, other performance criteria are also discussed. © 2008 Elsevier B.V. All rights reserved.

Identifier

56349094303 (Scopus)

Publication Title

International Journal of Production Economics

External Full Text Location

https://doi.org/10.1016/j.ijpe.2008.09.003

ISSN

09255273

First Page

251

Last Page

262

Issue

2

Volume

116

Grant

DMI-0556010

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS