Exact and approximation algorithms for the Tactical Fixed Interval Scheduling Problem

Operations Research

Volumn 45, Issue 4, 1997, Pages 624-638

  Kroon, Leo G ^a   Salomon, Marc ^b   Van Wassenhove, Luk N ^c  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b TILBURG UNIVERSITY   (Netherlands)

^c INSEAD   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AIRPORTS; ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; JOB ANALYSIS; PEOPLE MOVERS; PLANNING; TIME AND MOTION STUDY;

TACTICAL FIXED INTERVAL SCHEDULING;

SCHEDULING;

EID: 0031187695     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.45.4.624     Document Type: Article

References (23)

1. AHUJA, R. K., T. L. MAGNANTI, AND J. B. ORLIN. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
2. ARKIN, E. M. AND E. L. SILVERBERG. 1987. Scheduling Jobs With Fixed Start and Finish Times. Discrete Appl. Math. 18, 1-8.
3. CARTER, M. W. 1989. A Lagrangian Relaxation Approach to the Classroom Assignment Problem. INFOR. 27, 230-246.
4. CARTER, M. W. AND C. A. TOVEY. 1992. When is the Classroom Assignment Problem Hard? Opns. Res. 40, S28-S39.
5. DANTZIG, G. L. AND D. R. FULKERSON. 1954. Minimizing the Number of Tankers to Meet a Fixed Schedule. Naval Res. Logist, 1, 217-222.
6. DIJKSTRA, M. C., L. G. KROON, J. A. E. E. VAN NUNEN, AND M. SALOMON. 1991. A DSS for Capacity Planning of Aircraft Maintenance Personnel. International J. of Production Res. 23, 69-78.
7. DIJKSTRA, M. C., L. G. KROON, M. SALOMON, J. A. E. E. VAN NUNEN, AND L. N. VAN WASSENHOVE. 1994. Planning the Size and Organization of KLM's Maintenance Personnel. Interfaces 24, 47-58.
8. DILWORTH, R. P. 1950. A Decomposition Principle for Partially Ordered Sets. Ann. Math. 51, 161-166.
9. DONDETI, V. R. AND H. EMISIONS. 1992. Interval Scheduling With Processors of Two Types. Opns. Res. 40, S76-S85.
10. DONDETI, V. R. AND H. EMMONS. 1993. Algorithms for Preemptive Scheduling of Different Classes of Processors to Do Jobs With Fixed Times. Eur. J. Opnl. Res. 70, 316-326.
11. ERLENKOTTER, D. 1978. A Dual-Based Procedure for Uncapacitated Facility Location. Opns. Res. 26, 992-1000.
12. FISCHETTI, M., S. MARTELLO, AND P. TOTH. 1987. The Fixed Job Schedule Problem With Spread Time Constraints. Opns. Res. 6, 849-858.
13. FISCHETTI, M., S. MARTELLO, AND P. TOTH. 1989. The Fixed Job Schedule Problem With Working Time Constraints. Opns. Res. 3, 395-403.
14. FISCHETTI, M., S. MARTELLO AND P. TOTH. 1992. Approximation Algorithms for Fixed Job Schedule Problems. Opns. Res. 40, S96-S108.
15. FISHER, M. L. 1981. The Lagrangian Relaxation Method for Solving Integer Programming Problems. Mgmt. Sci. 27, 1-18.
16. GEOFFRION, A. M. 1974. Lagrangian Relaxation and Its Uses in Integer Programming. Math. Prog. Study, 2, 82-114.
17. GERTSBAKH, I. AND H. I. STERN. 1978. Minimal Resources for Fixed and Variable Job Schedules. Opns. Res. 18, 68-85.
18. GUPTA, U. L., D. T. LEE, AND J. Y.-T LEUNG. 1979. An Optimal Solution to the Channel Assignment Problem. IEEE Trans. Comput. C-28, 807-810.
19. HASHIMOTO, A. AND J. STEVENS. 1971. Wire Routing by Optimizing Channel Assignments Within Large Apertures. In Proceedings of the 8th Design Automation Workshop, 155-169.
20. IBM. 1991. Optimization Subroutine Library. Release 2: Guide and References. Third Edition.
21. KOLEN, A. W. J. AND L. G. KROON. 1991. On the Computational Complexity of (Maximum) Class Scheduling. Eur. J. Opnl. Res. 54, 23-38.
22. KOLEN, A. W. J. AND L. G. KROON. 1992. License Class Design: Complexity and Algorithms. Eur. J. Opnl. Res. 63, 432-444.
23. KROON, L. G. 1990. Job Scheduling and Capacity Planning in Aircraft Maintenance. Ph.D. Thesis, Rotterdam School of Management, Erasmus University.