Fixed interval scheduling: Models, applications, computational complexity and algorithms

doi:10.1016/j.ejor.2006.01.049

Return

Fixed interval scheduling: Models, applications, computational complexity and algorithms

2007-04-01

128

PRE

Mikhail Y. Kovalyov *

C.T. Ng

T.C.E. Cheng

DOI：10.1016/j.ejor.2006.01.049

Original

Original request for help

Save

Abstract

En 中文

The defining characteristic of fixed interval scheduling problems is that each job has a finite number of fixed processing intervals. A job can be processed only in one of its intervals on one of the available machines, or is not processed at all. A decision has to be made about a subset of the jobs to be processed and their assignment to the processing intervals such that the intervals on the same machine do not intersect. These problems arise naturally in different real-life operations planning situations, including the assignment of transports to loading/unloading terminals, work planning for personnel, computer wiring, bandwidth allocation of communication channels, printed circuit board manufacturing, gene identification and examining computer memory structures. We present a general formulation of the interval scheduling problem, show its relations to cognate problems in graph theory, and survey existing models, results on computational complexity and solution algorithms. (c) 2006 Elsevier B.V. All rights reserved.

Keywords:

interval scheduling

interval graph

k-coloring

k-track assignment

discrete starting times

maximum weight clique

maximum weight independent set

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.