Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지
DOI QR코드

DOI QR Code

Scheduling Algorithms for the Maximal Total Revenue on a Single Processor with Starting Time Penalty

  • Joo, Un-Gi (Department of Industrial and Management Engineering, Sun Moon University)
  • Received : 2011.12.08
  • Accepted : 2012.03.10
  • Published : 2012.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers a revenue maximization problem on a single processor. Each job is identified as its processing time, initial reward, reward decreasing rate, and preferred start time. If the processor starts a job at time zero, revenue of the job is its initial reward. However, the revenue decreases linearly with the reward decreasing rate according to its processing start time till its preferred start time and finally its revenue is zero if it is started the processing after the preferred time. Our objective is to find the optimal sequence which maximizes the total revenue. For the problem, we characterize the optimal solution properties and prove the NP-hardness. Based upon the characterization, we develop a branch-and-bound algorithm for the optimal sequence and suggest five heuristic algorithms for efficient solutions. The numerical tests show that the characterized properties are useful for effective and efficient algorithms.

Keywords

References

  1. Aspvall, B., S. D. Flam, and K. P. Villanger, "Selecting among scheduled projects," Operations Research Letter 17 (1995), 37-40. https://doi.org/10.1016/0167-6377(94)00055-B
  2. Baker, K. R., Introduction to sequencing and scheduling, John Wiley and Sons, Inc., 1974.
  3. Cesaret, B., C. Oguz, and F. S. Salman, "A tabu search algorithm for order acceptance and scheduling," Computers and Operations Research, 2010, doi:10.1016/j.cor.2010.09.18.
  4. Charnsirisakskul, K., P. M. Griffin, and P. Keskinocak, "Order selection and scheduling with leadtime flexibility," IIE Transactions 36 (2004), 697-707. https://doi.org/10.1080/07408170490447366
  5. Du, J. and J. Y. T. Leung, "Minimizing total tardiness on one machine is NP-hard," Mathematics of Operations Research 15 (1990), 483-495. https://doi.org/10.1287/moor.15.3.483
  6. Gupta, S. K., J. Kyparisis, and C. M. Ip, "Project selection and sequencing to maximize net present value of the total return," Management Science 38 (1992), 751-752. https://doi.org/10.1287/mnsc.38.5.751
  7. Kesskinocak, P., R. Ravi, and S. Tayur, "Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues," Management Science 47 (2001), 264-279. https://doi.org/10.1287/mnsc.47.2.264.9836
  8. Kyparisis, G. J., S. K. Gupta, and C. M. Ip, "Project selection with discounted returns and multiple constraints," European Journal of Operational Research 94 (1996), 87-96. https://doi.org/10.1016/0377-2217(95)00156-5
  9. Lodree, Jr. E. J., C. D. Geiger, and X. Jiang, "Taxonomy for integrating scheduling theory and human factors: review and research opportunities," International Journal of Industrial Ergonomics 36 (2009), 39-51.
  10. Nobibon, F. T. and R. Leus, "Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment," Computers and Operations Research 38 (2011), 367-378. https://doi.org/10.1016/j.cor.2010.06.003
  11. Rom, W. O. and S. A. Slotnick, "Order acceptance using genetic algorithms," Computers and Operations Research 36 (2009), 1758-1767. https://doi.org/10.1016/j.cor.2008.04.010
  12. Rothkopf, M. H. and S. A. Smith, "There are no undiscovered priority index sequencing rules for minimizing total delay costs," Operations Research 32 (1984), 451-456. https://doi.org/10.1287/opre.32.2.451
  13. Slotnick, S. A. and T. E. Morton, "Order acceptance with weighted tardiness," Computers and Operations Research 34 (2007), 3029-3042. https://doi.org/10.1016/j.cor.2005.11.012
  14. Slotnick, S. A., "Order acceptance and scheduling: a taxonomy and review," European Journal of Operational Research 212 (2011), 1-11 https://doi.org/10.1016/j.ejor.2010.09.042
  15. Yang, W. H., "Scheduling jobs on a single machine to maximize the total revenue of jobs," Computers and Operations Research 36 (2009), 565-583. https://doi.org/10.1016/j.cor.2007.10.018