Normal view MARC view

Exact and approximation algorithms for the tactical fixed interval scheduling problem

Author: Kroon, L. G. ; Salomon, M. ; Van Wassenhove, Luk N.INSEAD Area: Technology and Operations Management Series: Working Paper ; 94/04/TM Publisher: Fontainebleau : INSEAD, 1994.Language: FrenchDescription: 27 p.Type of document: INSEAD Working Paper Online Access: Click here Abstract: The Tactical Fixed Interval Scheduling Problem (TFISP) is the problem of determining the minimum number of parallel non-identical machines, such that a feasible schedule exists for a given set of jobs. In TFISP each job must be carried out in a perspecified time interval and belongs to a specific job class. The problem is complicated by the restrictions that (i) each machine can handle one job at a time only, (ii) each machine can handle jobs from a subset of the job classes only, and (iii) preemption is not allowed. In this paper we discuss the occurrence of TFISP in practice, we analyse the computational complexity of TFISP, and we present exact and approximation algorithms for solving TFISP. The paper is concluded with a computational study
Tags: No tags from this library for this title. Add tag(s)
Log in to add tags.
Item type Current location Collection Call number Status Date due
INSEAD Working Paper Digital Library
PDF Available

The Tactical Fixed Interval Scheduling Problem (TFISP) is the problem of determining the minimum number of parallel non-identical machines, such that a feasible schedule exists for a given set of jobs. In TFISP each job must be carried out in a perspecified time interval and belongs to a specific job class. The problem is complicated by the restrictions that (i) each machine can handle one job at a time only, (ii) each machine can handle jobs from a subset of the job classes only, and (iii) preemption is not allowed. In this paper we discuss the occurrence of TFISP in practice, we analyse the computational complexity of TFISP, and we present exact and approximation algorithms for solving TFISP. The paper is concluded with a computational study

Digitized

There are no comments for this item.

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