The extraboard operator scheduling and work assignment problem

References

• Arkin, E.M. and Silverberg, B. (1987) Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 18(1), 1–8.
   Web of Science ®Google Scholar
• Arora, S. and Lund, C. (1997) Hardness of approximations, in Approximation Algorithms for NP-hard Problems, Hochbaum, D.S. (eds), PWS Publishing Company, Boston, MA., pp. 399–446.
   Google Scholar
• Bhatia, R., Chuzhoy, J., Freund, A. and Naor, J. (2007) Algorithmic aspects of bandwidth trading. ACM Transactions on Algorithms, 3(1), 1–19.
   Google Scholar
• Brucker, P. and Nordmann, L. (1994) The k-track assignment problem. Computing, 52(2), 97–122.
   Web of Science ®Google Scholar
• Cornuejols, G., Fisher, M.L. and Nemhauser, G.L. (1977) Location of bank accounts to optimize float: an analytic study exact and approximate algorithms. Management Science, 23, 789–810.
   Web of Science ®Google Scholar
• DeAnnuntis, C.P. and Morris, W.P. (2007) Transit extraboard management - optimum sizing and strategies final report, available from http://www.nctr.usf.edu/pdf/77707.pdf. Accessed September 2009.
   Google Scholar
• Eliiyi, D.T. and Azizoglu, M. (2006) Spread time considerations in operational fixed job scheduling. International Journal of Production Research, 44(20), 4343–4365.
   Web of Science ®Google Scholar
• Faigle, U., Kern, W. and Nawijn, W.M. (1999) A greedy on-line algorithm for the k-track assignment problem. Journal of Algorithms, 31, 196–210.
   Web of Science ®Google Scholar
• Faigle, U. and Nawijn, W.M. (1995) Note on scheduling intervals on-line. Discrete Applied Mathematics, 58, 13–17.
   Web of Science ®Google Scholar
• Feo, T.A. and Resende, M.G.C. (1995) Greedy randomized adaptive search heuristic. Journal of Global Optimization, 6, 109–133.
   Web of Science ®Google Scholar
• Fischetti, M., Martello, S. and Toth, P. (1987) The fixed job schedule problem with spread-time constraints. Operations Research, 35(6), 849–858.
   Web of Science ®Google Scholar
• Fischetti, M., Martello, S. and Toth, P. (1989) The fixed job schedule problem with working-time constraints. Operations Research, 37, 395–403.
   Web of Science ®Google Scholar
• Fischetti, M., Martello, S. and Toth, P. (1992) Approximation algorithms for fixed job schedule problems. Operations Research, 40(Supplement), S96–S108.
   Web of Science ®Google Scholar
• Fisher, M.L. (1981) The lagrangian relaxation method for solving integer programming problems. Management Science, 27(1), 1–18.
   Web of Science ®Google Scholar
• Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability: A Guide to the Theorey of NP-completeness. W. H. Freeman, San Francisco, CA.
   Google Scholar
• Gertsbakh, I. and Stern, H.I. (1978) Minimal resources for fixed and variable job schedules. Operations Research, 26(1), 68–85.
   Web of Science ®Google Scholar
• Ghouila-Houri, A. (1962) Caractérisation des matrices totalement unimodulaires. Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, 254, 1192–1194.
   Web of Science ®Google Scholar
• Hochbaum, D.S. (1997) Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston, MA.
   Google Scholar
• Khuller, S., Moss, A. and Naor, S.J. (1999) The budgeted maximum coverage problem. Information Processing Letters, 70, 39–45.
   Web of Science ®Google Scholar
• Kolen, A.W.J. and Kroon, L.G. (1993) On the computational complexity of (maximum) shift class scheduling. European Journal of Operational Research, 64, 138–151.
   Web of Science ®Google Scholar
• Kolen, A.W.J., Lenstra, J.K., Papadimitriou, C.H. and Spieksma, F.C.R. (2007) Interval scheduling: a survey. Naval Research Logistics, 54(5), 530–543.
   Web of Science ®Google Scholar
• Korte, B. and Vygen, J. (2006) Combinatorial Optimization: Theory and Algorithms. Springer, New York, NY.
   Google Scholar
• Koutsopoulos, H.N. (1990) Scheduling of extraboard operators in transit systems. Transportation Sciences, 24(2), 87–105.
   Web of Science ®Google Scholar
• Kroon, L.G., Salomon, M. and van Wassenhove, L.N. (1995) Exact and approximation algorithms for the operational fixed interval scheduling problem. European Journal of Operational Research, 82, 190–205.
   Web of Science ®Google Scholar
• Lourenco, H.R., Paixao, J. and Portugal, R. (2001) Multiobjective metaheuristics for the bus driver scheduling problem. Tansportation Science, 35(3), 331–343.
   Web of Science ®Google Scholar
• MacDorman, L.C. (1985) Extraboard management: procedures and tools. National Cooperative Transit Research and Development Program, Synthesis of Transit Practice Report No. 5, Transportation Research Board, National Research Council, Washington, D.C.
   Google Scholar
• MacDorman, L.C. and MacDorman, J.C. (1982) The transit extraboard: some opportunities for cost savings, presented at the APTA Annual Meeting, October, Boston, MA.
   Google Scholar
• Martello, S. and Toth, P. (1986) A heuristic approach to the bus driver scheduling problem. European Journal of Operational Research, 24, 106–117.
   Web of Science ®Google Scholar
• Müller, A. and Stoyan, D. (2002) Comparison Methods for Stochatic Models and Risks. John Wiley & Sons, Chichester, UK.
   Google Scholar
• Perry, J.L. and Long, L. (1984) Extraboard scheduling, workers compensation, and operators stress in public transit: research results and managerial implications. Transportation Research Record, 1002, 21–28.
   Google Scholar
• Shaked, M. and Shanthikumar, J. (1994) Stochastic Orders and Their Applications. Academic Press, New York, NY.
   Google Scholar
• Sivrikaya-Serifoglu, F. and Ulusoy, G. (1999) Parallel machine scheduling with earliness and tardiness penalties. Computers and Operations Research, 26, 773–787.
   Web of Science ®Google Scholar
• Solyali, O. and Ozpeynirci, O. (2009) Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm. International Journal of Production Research, 47(7), 1877–1893.
   Web of Science ®Google Scholar