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

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

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 178; no. 2; pp. 331 - 342
Main Authors:	Kovalyov, Mikhail Y., Ng, C.T., Cheng, T.C. Edwin
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.04.2007 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Algorithms Applied sciences Discrete starting times Exact sciences and technology Graph theory Interval graph Interval scheduling k-coloring k-track assignment Maximum weight clique Maximum weight independent set Operational research and scientific management Operational research. Management science Scheduling algorithms Scheduling, sequencing Studies Interval graph Maximum weight independent set Discrete starting times Maximum weight clique Interval scheduling k-track assignment k-coloring Resource allocation Transmission channel Unloading Printed circuit board Scheduling Graph theory Bandwidth allocation Computational complexity Wiring Interconnection Algorithm complexity Discrete time Channel allocation Independent set Planning Work planning
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!