Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 5791796, 8 pages
https://doi.org/10.1155/2017/5791796
Research Article

A Single-Machine Scheduling Problem with Uncertainty in Processing Times and Outsourcing Costs

1Department of Industrial and Management Systems Engineering, Kyung Hee University, 1732 Deogyeong-daero, Giheung-gu, Yongin-si, Kyunggi-do 17104, Republic of Korea
2Department of Business Administration, Chungnam National University, 99 Daehak-ro, Yuseong-gu, Daejeon 34134, Republic of Korea

Correspondence should be addressed to Byung-Cheon Choi; rk.ca.unc@emitylop

Received 13 December 2016; Accepted 22 February 2017; Published 5 March 2017

Academic Editor: Sabri Arik

Copyright © 2017 Myoung-Ju Park and Byung-Cheon Choi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. L. Daniels and P. Kouvelis, “Robust scheduling to hedge against processing time uncertainty in single-stage production,” Management Science, vol. 41, no. 2, pp. 363–376, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. P. Kouvelis and G. Yu, Robust Discrete Optimization and Its Applications, vol. 14 of Nonconvex Optimization and Its Applications, Kluwer Academic, Dordrecht, Netherlands, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  3. H. Aissi, C. Bazgan, and D. Vanderpooten, “Min-max and min-max regret versions of combinatorial optimization problems: a survey,” European Journal of Operational Research, vol. 197, no. 2, pp. 427–438, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  4. R. G. Vickson, “Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine,” Operations Research, vol. 28, no. 5, pp. 1155–1167, 1980. View at Publisher · View at Google Scholar · View at Scopus
  5. D. Shabtay, N. Gaspar, and M. Kaspi, “A survey on offline scheduling with rejection,” Journal of Scheduling, vol. 16, no. 1, pp. 3–28, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. B.-C. Choi and K. Chung, “Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty,” European Journal of Operational Research, vol. 252, no. 2, pp. 367–375, 2016. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. D. W. Engels, D. R. Karger, S. G. Kolliopoulos, S. Sengupta, R. N. Uma, and J. Wein, “Techniques for scheduling with rejection,” Journal of Algorithms. Cognition, Informatics and Logic, vol. 49, no. 1, pp. 175–191, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  8. J. B. Ghosh, “Job selection in a heavily loaded shop,” Computers and Operations Research, vol. 24, no. 2, pp. 141–145, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. E. Conde, “A 2-approximation for minmax regret problems via a mid-point scenario optimal solution,” Operations Research Letters, vol. 38, no. 4, pp. 326–327, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. E. Conde, “On a constant factor approximation for minmax regret problems using a symmetry point scenario,” European Journal of Operational Research, vol. 219, no. 2, pp. 452–457, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. A. Kasperski and P. Zieliński, “A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion,” Operations Research Letters, vol. 36, no. 3, pp. 343–344, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. V. Lebedev and I. Averbakh, “Complexity of minimizing the total flow time with interval data and minmax regret criterion,” Discrete Applied Mathematics, vol. 154, no. 15, pp. 2167–2177, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, NY, USA, 1979. View at MathSciNet
  14. A. Kasperski and P. Zieliński, “An approximation algorithm for interval data minmax regret combinatorial optimization problems,” Information Processing Letters, vol. 97, no. 5, pp. 177–180, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus