Normal view MARC view

Exact and approximation algorithms for the operational fixed interval scheduling problem

Author: Van Wassenhove, Luk N. ; Kroon, Leo G. ; Salomon, MarcINSEAD Area: Technology and Operations ManagementIn: European Journal of Operational Research, vol. 82, no. 2, April 1995 Language: EnglishDescription: p. 190-205.Type of document: INSEAD ArticleNote: Please ask us for this itemAbstract: The Operational Fixed Interval Scheduling Problem (OFISP) is characterised as the problem of scheduling a number of jobs, each with a fixed starting time, a fixed finishing time, a priority index, and a job class. The objective is to find an assignment of jobs to machines with maximal total priority. The problem is complicated by the fact that each machine can only handle one job at a time, each machine can only handle jobs from a prespecified subset of all possible job classes, and preemption is not allowed. It follows from the above that OFISP has both the character of a job scheduling problem and the character of an assignment problem. In this paper, the occurrence of the problem in practice is discussed, and newly-developed exact and approximation algorithms for solving OFISP are presented. Finally, some computational results are shown
Tags: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode Item holds
INSEAD Article Europe Campus
Available BC003883
Total holds: 0

Ask Qualtrics

The Operational Fixed Interval Scheduling Problem (OFISP) is characterised as the problem of scheduling a number of jobs, each with a fixed starting time, a fixed finishing time, a priority index, and a job class. The objective is to find an assignment of jobs to machines with maximal total priority. The problem is complicated by the fact that each machine can only handle one job at a time, each machine can only handle jobs from a prespecified subset of all possible job classes, and preemption is not allowed. It follows from the above that OFISP has both the character of a job scheduling problem and the character of an assignment problem. In this paper, the occurrence of the problem in practice is discussed, and newly-developed exact and approximation algorithms for solving OFISP are presented. Finally, some computational results are shown

Digitized

There are no comments for this item.

Log in to your account to post a comment.
Koha 18.11 - INSEAD Catalogue
Home | Contact Us | What's Koha?