References

  1. H. Aydin, R. Melhem, D. Mosse & P. Mejfa-Alvarez (1999): Optimal reward-based scheduling of periodic real-time tasks. In: Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054), pp. 79–89, doi:10.1109/REAL.1999.818830.
  2. Sanjoy K. Baruah, Rodney R. Howell & Louis Rosier (1990): Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. Real-Time Systems 2, pp. 301–324, doi:10.1007/BF01995675.
  3. Alan Burns (1991): Scheduling hard real-time systems: a review. Software Engineering Journal 6(3), pp. 116–128, doi:10.1049/sej.1991.0015.
  4. Damien Busatto-Gaston, Debraj Chakraborty, Shibashis Guha, Guillermo A. Pérez & Jean-François Raskin (2021): Safe Learning for Near-Optimal Scheduling. In: Quantitative Evaluation of Systems: 18th International Conference, QEST 2021, Paris, France, August 23–27, 2021, Proceedings. Springer-Verlag, Berlin, Heidelberg, pp. 235–254, doi:10.1007/978-3-030-85172-9_13.
  5. Giorgio C Buttazzo, Marko Bertogna & Gang Yao (2012): Limited preemptive scheduling for real-time systems. a survey. IEEE transactions on Industrial Informatics 9(1), pp. 3–15, doi:10.1109/TII.2012.2188805.
  6. H. Chetto & M. Chetto (1989): Some Results of the Earliest Deadline Scheduling Algorithm. IEEE Transactions on Software Engineering 15(10), pp. 1261–1269, doi:10.1109/TSE.1989.559777.
  7. Robert Davis & Alan Burns (2009): A survey of hard real-time scheduling algorithms and schedulability analysis techniques for multiprocessor systems. Technical Report. University of York, Department of Computer Science, YCS-2009-443.
  8. Robert Davis & Alan Burns (2011): A survey of hard real-time scheduling for multiprocessor systems. ACM computing surveys (CSUR) 43(4), pp. 1–44, doi:10.1145/1978802.1978814.
  9. Sudarshan K Dhall & Chung Laung Liu (1978): On a real-time scheduling problem. Operations research 26(1), pp. 127–140, doi:10.1287/opre.26.1.127.
  10. Gilles Geeraerts, Shibashis Guha & Jean-François Raskin (2018): Safe and Optimal Scheduling for Hard and Soft Tasks. In: 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), Leibniz International Proceedings in Informatics (LIPIcs) 122, pp. 36:1–36:22, doi:10.4230/LIPIcs.FSTTCS.2018.36.
  11. Abhijit Gosavi (1997): Simulation-Based Optimization: Parametric Optimization Techniques and Reinforcement Learning. Operations Research/ Computer Science Interfaces Series 25, doi:10.1007/978-1-4757-3766-0.
  12. K.S. Hong & J.Y.-T. Leung (1992): On-line scheduling of real-time tasks. IEEE Transactions on Computers 41(10), pp. 1326–1331, doi:10.1109/12.166609.
  13. Sang Hyun Kim (2019): Receding horizon scheduling of on-demand urban air mobility with heterogeneous fleet. IEEE Transactions on Aerospace and Electronic Systems 56(4), pp. 2751–2761, doi:10.1109/TAES.2019.2953417.
  14. Imke C Kleinbekman, Mihaela A Mitici & Peng Wei (2018): eVTOL arrival sequencing and scheduling for on-demand urban air mobility. In: 2018 IEEE/AIAA 37th Digital Avionics Systems Conference (DASC). IEEE, pp. 1–7, doi:10.1109/DASC.2018.8569645.
  15. John P. Lehoczky, Lui Sha & Jay K. Strosnider (1987): Enhanced Aperiodic Responsiveness In Hard Real-Time Environments.. In: RTSS 1987. IEEE, pp. 261–270.
  16. Joseph Y.T. Leung & M. L. Merrill (1980): A note on preemptive scheduling of periodic, real-time tasks. Information Processing Letters 11(3), pp. 115–118, doi:10.1016/0020-0190(80)90123-4.
  17. Kwei-Jay Lin, Swaminathan Natarajan & Jane W-S Liu (1987): Imprecise results: Utilizing partial computations in real-time systems. Technical Report. NASA.
  18. C. L. Liu & James W. Layland (1973): Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. J. ACM 20(1), pp. 46–61, doi:10.1145/321738.321743.
  19. Steve Paul & Souma Chowdhury (2022): A Graph-based Reinforcement Learning Framework for Urban Air Mobility Fleet Scheduling. In: AIAA AVIATION 2022 Forum, pp. 3911, doi:10.2514/6.2022-3911.vid.
  20. Priyank Pradeep & Peng Wei (2018): Heuristic approach for arrival sequencing and scheduling for eVTOL aircraft in on-demand urban air mobility. In: 2018 IEEE/AIAA 37th Digital Avionics Systems Conference (DASC). IEEE, pp. 1–7, doi:10.1109/DASC.2018.8569225.
  21. Martin L. Puterman (1994): Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1st edition. John Wiley & Sons, Inc., USA, doi:10.1002/9780470316887.
  22. Syed Arbab Mohd Shihab, Peng Wei, Daniela Sofia Jurado Ramirez, Rodrigo Mesa-Arango & Christina Bloebaum (2019): By schedule or on demand?-a hybrid operation concept for urban air mobility. In: AIAA Aviation 2019 Forum, pp. 3522, doi:10.2514/6.2019-3522.
  23. Marco Spuri & Giorgio C. Buttazzo (2004): Scheduling aperiodic tasks in dynamic priority systems. Real-Time Systems 10, pp. 179–210, doi:10.1007/BF00360340.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org