Management Science and Financial Engineering

  • 제18권2호
  • /
  • Pages.5-11
  • /
  • 2012
  • /
  • 2287-2043(pISSN)
  • /
  • 2287-2361(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지
DOI QR코드

DOI QR Code

Stochastic Scheduling Problems for Maximizing the Expected Number of Early Jobs with Common or Exchangeable Due Dates

  • 투고 : 2012.05.05
  • 심사 : 2012.05.30
  • 발행 : 2012.11.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, stochastic scheduling problems are considered when processing times and due dates follow arbitrary distributions and due dates are either common or exchangeable. For maximizing the expected number of early jobs, two policies, one, based on pairwise comparisons of the processing times, and the other, based on survivabilities, are introduced. In addition, it is shown that the former guarantees optimal solutions when the processing times and due dates are deterministic and that the latter guarantees optimal solutions when the due dates follow exponential distributions. Then a new approach, exploiting the two policies, is proposed and analyzed which turns out to give better job sequences in many situations. In fact, the new approach guarantees optimal solutions both when the processing times and due dates are deterministic and when the due dates follow exponential distributions.

키워드

참고문헌

  1. Boxma, O. J. and F. G. Forst, "Minimizing the Expected Weighted Number of Tardy Jobs in Stochastic Flow Shops," Operations Research Letters 5 (1986), 119-126. https://doi.org/10.1016/0167-6377(86)90084-2
  2. Cai, X. and S. Zhou, "Stochastic Scheduling on Parallel Machines subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs," Operations Research 47 (1999), 422-437. https://doi.org/10.1287/opre.47.3.422
  3. Choi, J. and H. Kim, "A Review on Scheduling Problems for Minimizing the Number of Late Jobs," Korean Production and Operations Management Society 22 (2011), 159-175.
  4. De, P., 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 (1991), 457-463. https://doi.org/10.1016/0305-0548(91)90022-J
  5. Jang, W., "Dynamic Scheduling of Stochastic Jobs on a Single Machine," European Journal of Operational Research 138 (2002), 518-530. https://doi.org/10.1016/S0377-2217(01)00174-6
  6. Li, W. and K. D. Galzebrook, "On Stochastic Machine Scheduling with General Distributional Assumptions," European Journal of Operational Research 105 (1998), 525-536. https://doi.org/10.1016/S0377-2217(97)00088-X
  7. Pinedo, M., "Stochastic Scheduling with Release Dates and Due Dates," Operations Research 31 (1983), 559-572. https://doi.org/10.1287/opre.31.3.559
  8. Sarin, S. C., 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 (1991), 188-198. https://doi.org/10.1016/0377-2217(91)90249-U
  9. Ross, S. M., "Stochastic Processes," John Wiley and Sons, New York, 1996.
  10. Sterna, M., "Late work scheduling in shop systems," Publishing House of Poznan University of Technology, Poznan, Polland, 2006.