Exact and approximation algorithms for the tactical fixed interval scheduling problem
The Tactical Fixed Interval Scheduling Problem (TFISP) is the problem of determining the minimum number of parallel nonidentical machines, such that a feasible schedule exists for a given set of jobs. In TFISP, each job must belong to a specific job class and must be carried out in a prespecified time interval. The problem is complicated by the restrictions that (1) each machine can handle only one job at a time, (2) each machine can handle only jobs from a subset of the job classes, and (3) preemption is not allowed. In this paper we discuss the occurrence of TFISP in practice, we analyze the computational complexity of TFISP, and we present exact and approximation algorithms for solving TFISP. The paper concludes with a computational study.
|Keywords||algorithms, approximation theory, computational complexticity, feasibility studies, machinery, operations research, production scheduling|
Kroon, L.G., Salomon, M., & van Wassenhove, L.N.. (1997). Exact and approximation algorithms for the tactical fixed interval scheduling problem. Operations Research, 624–638. Retrieved from http://hdl.handle.net/1765/14327