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 Management Series: Working Paper ; 92/08/TM Publisher: Fontainebleau : INSEAD, 1992.Language: EnglishDescription: 12 p.Type of document: INSEAD Working Paper Online Access: Click here Abstract: 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| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
|
Digital Library | Available | BC000936 |
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.