Advertisement

Scheduling Assistance for Passengers with Special Needs in Large Scale Airports

  • Michele MeleEmail author
  • Paola Festa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11184)

Abstract

In this paper we study a specific variant of the well known Fixed Job Scheduling Problem, namely the Tactical Fixed Job Scheduling Problem with Spread-Time constraints. In this problem it is required to schedule a number of jobs on non identical machines that differ each other for the set of jobs they can perform and that have constraints on the length of their duty. We present some lower bounds for the optimal value of the problem and introduce the first heuristic algorithm for solving it. We also study a specific case of interest connected with the assistance of passengers with special needs in large scale airports.

Keywords

Operations research Combinatorial optimization Scheduling Heuristic algorithm Fixed job scheduling Accessibility 

References

  1. 1.
    Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton, New Jersey (1962)zbMATHGoogle Scholar
  2. 2.
    Gertsbakh, I., Stern, H.I.: Minimal resources for fixed and variable job schedules. Oper. Res. 26(1), 68–85 (1978)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: An optimal solution for the channel-assignment problem. In: IEEE Transactions on Computers C, pp. 807–810. IEEE (1979)CrossRefGoogle Scholar
  4. 4.
    Fischetti, M., Martello, S., Toth, P.: The fixed job schedule problem with spread-time constraints. Oper. Res. 35(6), 849–858 (1987)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Fischetti, M., Martello, S., Toth, P.: The fixed job schedule problem with working-time constraints. Oper. Res. 37(3), 395–403 (1989)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Fischetti, M., Martello, S., Toth, P.: Approximation algorithms for fixed job schedule problems. Oper. Res. 40(1(Suppl. 1)), S96–S108 (1992)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Kolen, A., Kroon, L.: License class design: complexity and algorithms. Eur. J. Oper. Res. 63(3), 432–444 (1992)CrossRefGoogle Scholar
  8. 8.
    Kroon, L., Salomon, M., Van Wassenhove, L.: Exact and approximation algorithms for the tactical fixed interval scheduling problem. Oper. Res. 45(4), 624–638 (1997)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Zhou, S., Zhang, X., Chen, B., van de Velde, S.: Tactical fixed job scheduling with spread-time constraints. Comput. Oper. Res. 47, 53–60 (2014)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Kovalyov, M.Y., Ng, C.T., Chen, T.C.E.: Fixed interval scheduling: models, applications, computational complexity and algorithms. Eur. J. Oper. Res. 178(2), 331–342 (1992)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Kolen, A., Lenstra, J., Papadimitriou, C., Spieksma, F.: Interval scheduling: a survey. Nav. Res. Logist. (NRL) 54(5), 530–543 (1992)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Keil, M.: On the complexity of scheduling tasks with discrete starting times. Oper. Res. Lett. 12(5), 293–295 (1992)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Huang, Q., Lloyd, E.: Cost Constrained Fixed Job Scheduling. In: 8th Italian Conference on Theoretical Computer Science, pp. 111–124 (2013)Google Scholar
  14. 14.
    Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, New York (2011)Google Scholar
  15. 15.
    Scholl, A.: Balancing and Sequencing of Assembly Lines. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  16. 16.
    Martello, S., Toth, P.: A heuristic approach to the bus driver scheduling problem. Eur. J. Oper. Res. 24(1), 106–117 (1986)CrossRefGoogle Scholar
  17. 17.
    De Leone, R., Festa, P., Marchitto, E.: A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution. J. Heuristics 17(4), 441–466 (2011)Google Scholar
  18. 18.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)Google Scholar
  19. 19.
    Cabrera, G.G., Rubio, J. M. L.: Hybrid algorithm of tabu search and integer programming for the railway crew scheduling problem. In: 2th Asia-Pacific Conference on Computational Intelligence and Industrial Applications, pp. 413–416 (2009)Google Scholar
  20. 20.
    Wren, A., Rousseau, J.M.: Bus Driver Scheduling - An Overview. School of Computer Studies Research Report Series, University of Leeds, vol. 93(31), pp. 1–14 (1993)Google Scholar
  21. 21.
    Portugal, R., Lourenco, H.R., Paixao, J.P.: Driver scheduling problem modelling. Public Transp. 1(2), 103–120 (2008)CrossRefGoogle Scholar
  22. 22.
    Rodrigues, M.M., de Souza, C.C., Moura, A.V.: Vehicle and crew scheduling for urban bus lines. Eur. J. Oper. Res. 170(3), 844–862 (2006)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Mastelic, T., Fdhila, W., Brandic, I., Rinderle-Ma, S.: Predicting resource allocation and costs for business processes in the cloud. In: 11th World Congress on Services, pp. 47–54 (2015)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of Mathematics and ApplicationsUniversity of Naples “Federico II”NaplesItaly

Personalised recommendations