Journal of the Korea Society of Computer and Information (한국컴퓨터정보학회논문지)

Korean Society of Computer Information (한국컴퓨터정보학회)
권호 표지
DOI QR코드

DOI QR Code

A Dynamic Programming Approach for Emergency Vehicle Dispatching Problems

  • Received : 2016.06.30
  • Accepted : 2016.08.29
  • Published : 2016.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this research, emergency vehicle dispatching problems faced with in the wake of massive natural disasters are considered. Here, the emergency vehicle dispatching problems can be regarded as a single machine stochastic scheduling problems, where the processing times are independently and identically distributed random variables, are considered. The objective of minimizing the expected number of tardy jobs, with distinct job due dates that are independently and arbitrarily distributed random variables, is dealt with. For these problems, optimal static-list policies can be found by solving corresponding assignment problems. However, for the special cases where due dates are exponentially distributed random variables, using a proposed dynamic programming approach is found to be relatively faster than solving the corresponding assignment problems. This so-called Pivot Dynamic Programming approach exploits necessary optimality conditions derived for ordering the jobs partially.

Keywords

References

  1. S. J. Balut. Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain. Management Science, 19(11):1283-1288, 1973. https://doi.org/10.1287/mnsc.19.11.1283
  2. R. A. Blau. N-Job, One Machine Sequencing Problems under Uncertainty. Management Science, 20(1):101-109, 1973. https://doi.org/10.1287/mnsc.20.1.101
  3. O. J. Boxma and F. G. Forst. Minimizing the Expected Weighted Number of Tardy Jobs in Stochastic Flow Shops. Operations Research Letters, 5:119-126, 1986. https://doi.org/10.1016/0167-6377(86)90084-2
  4. X. Cai and S. Zhou. Stochastic Scheduling on Parallel Machines subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs. Operations Research, 47(3):422-437, 1999. https://doi.org/10.1287/opre.47.3.422
  5. C-S. Chang, J. G. Shanthikumar, and D. D. Yao. "Stochastic Convexity and Stochastic Majorization," in Stochatic Modeling and Analysis of Manufacturing Systems (D. D. Yao, editor). Springer-Verlag, New York, 1994.
  6. P. De, J. B. Ghosh, and C. E. Wells. On the Minimization of the Weighted Number of Tardy Jobs with Random Processing Times and Deadline. Computers and Operations Research, 18:457-463, 1991. https://doi.org/10.1016/0305-0548(91)90022-J
  7. H. Emmons and M. Pinedo. Scheduling Stochastic Jobs with Due Dates on Parallel Machines. European Journal of Operational Research, 47:49-55, 1990. https://doi.org/10.1016/0377-2217(90)90088-S
  8. M. Held and R. M. Karp. A Dynamic Programming Approach to Sequencing Problems. J. SIAM, 10:196-210, 1962.
  9. W. Jang. Dynamic Scheduling of Stochastic Jobs on a Single Machine. European Journal of Operational Research, 138:518-530, 2002. https://doi.org/10.1016/S0377-2217(01)00174-6
  10. R. M. Karp. "Reducibility Among Combinatorial Problems," in Complexity of Computer Computations (R. E. Miller and J. W. Thatcher, eds). Plenum Press, New York, 1972.
  11. H. Kise and T. Ibaraki. On Balut's Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem. Management Science, 29(3):384-388, 1983. https://doi.org/10.1287/mnsc.29.3.384
  12. W. Li and K. D. Galzebrook. On Stochastic Machine Scheduling with General Distributional Assumptions. European Journal of Operational Research, 105:525-536, 1998. https://doi.org/10.1016/S0377-2217(97)00088-X
  13. M. J. Moore. An N Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs. Management Science, 15(1):102-109, 1968. https://doi.org/10.1287/mnsc.15.1.102
  14. G. R. Parker and R. L. Rardin. Discrete Optimization. Academic Press Inc., 1988.
  15. M. Pinedo. Stochastic Scheduling with Release Dates and Due Dates. Operations Research, 31(3):559-572, 1983. https://doi.org/10.1287/opre.31.3.559
  16. M. Pinedo. Scheduling : Theory, Algorithms, and Systems. Prentice-Hall Inc., 2002.
  17. S. C. Sarin, E. Erel, and G. Steiner. Sequencing Jobs on a Single Machine with a Common Due Date and Stochastic Processing Times. European Journal of Operational Research, 51:188-198, 1991. https://doi.org/10.1016/0377-2217(91)90249-U
  18. H. M. Soroush and L. D. Fredendall. The Stochastic Single Machine Scheduling Problem with Earliness and Tardiness Costs. European Journal of Operational Research, 77:287-302, 1994. https://doi.org/10.1016/0377-2217(94)90373-5
  19. D. V. Widder. The Laplace Transform. Princeton University Press, 1941.