경영과학 (Korean Management Science Review)

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

대안기계 스케쥴링 문제에 대한 라운딩 알고리듬

A rounding algorithm for alternate machine scheduling

  • 황학진 (조선대학교 산업공학과)
  • 발행 : 2007.11.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper we consider an alternate m machine scheduling problem in which each job having at most two eligible machines should be assigned with the objective of makespan minimization. For this problem. we propose a $O(m2^m)$ time rounding algorithm with performance ratio at most 1.5. For a little general problem where each job can be processed in at most three machines, we prove that a polynomial time algorithm does not exist with performance ratio less than 1.5.

키워드

참고문헌

  1. Azar, Y., J. Naor, and R. Rom, The competitiveness of On-Line Assignments, J. Algorithms, Vol.18(1995), pp.221-237 https://doi.org/10.1006/jagm.1995.1008
  2. Chang S.Y. and H.-C. Hwang, The worstcase analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines, Discrete Applied Mathematics, Vol. 92(1999), pp.135-147 https://doi.org/10.1016/S0166-218X(99)00049-9
  3. Coffman Jr E.G., M.R. Garey, and D.S. Johnson, An application of bin-packing to multiprocessor scheduling, SIAM J. Comput., Vol.7(1978), pp.1-17 https://doi.org/10.1137/0207001
  4. Friesen D.K., Tighter bounds for the multi processor scheduling algorithm, SIAM J. of Comput., Vol.13(1984), pp.35-59
  5. Garey M.R. and D.S. Johnson, Computers and Intractability：A Guide to the theory of NP-Completeness, Freeman, San Francisco, 1979
  6. Graham R.L., Bounds on multiprocessor timing anomalies, SIAM J. Appl. Math., Vol. 17(1969), pp.263-269
  7. Graham, R.L., E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, Optimization and Approximation in Deterministic Machine Scheduling： A Survey, Annals of Discrete Mathematics, Vol.5(1979), pp.287-326 https://doi.org/10.1016/S0167-5060(08)70356-X
  8. He Y., H. Kellerer, and V. Kotov, Linear Compound Algorithms for the Partitioning Problem, Naval Research Logistics, Vol.47 (2000), pp.593-601 https://doi.org/10.1002/1520-6750(200010)47:7<593::AID-NAV4>3.0.CO;2-H
  9. Hochbaum D.S. and D. Shmoys, Using dual approximation algorithms for scheduling problems： Theoretical and practical results, J. ACM, Vol.34(1987), pp.144-162 https://doi.org/10.1145/7531.7535
  10. Hochbaum D.S., Approximation Algorithms for NP-Hard Problems, PWS PUBLISHING COMPANY, Boston, (1997), 370-371
  11. Hwang H.-C. and S.Y. Chang, Parallel machines scheduling with machine shutdowns, Computers and Mathematics with Applications, Vol.36(1998), pp.21-31
  12. Hwang H.-C, A PTAS for nonsimultaneous parallel machine scheduling, Journal of the Korean Society of Maintenance Management, Vol.3(2003), pp.181-193
  13. Hwang H.-C. and G. Kim, 2-Approximation Algorithm for Parallel Machine Scheduling with Consecutive Eligibility, KIIE, Vol.29(2003), pp.190-196
  14. Hwang H.-C, LPT Scheduling for Multipurpose Machines, IE Interfaces, Vol.16(2003), pp.132-137
  15. Hwang H.-C, K. Lee, and S.Y. Chang, Parallel machine scheduling under a grade of service provision, Computers & Operations Research, Vol.31(2004), pp.2055-2061 https://doi.org/10.1016/S0305-0548(03)00164-3
  16. Hwang H.-C, S.Y. Chang, and Y. Hong, The Posterior Competitiveness for List Scheduling Algorithm on Machines with Eligibility Constraints, Asia-Pacific Journal of Operational Research, Vol.1(2004), pp.1-9
  17. Ibarra O.H. and C.E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, J. ACM, Vol.22 (1975), pp.463-468 https://doi.org/10.1145/321906.321909
  18. Kaplan R.S. and R. Cooper, Cost & Effect, Havard Business School Press, Boston, Massachusetts, 1997
  19. Kellerer H., U. Pferschy, A New Fully Polynomial Approximation Scheme for the Knapsack Problem, Journal of Combinatorial Optimization, Vol.3(1999), pp.59-71 https://doi.org/10.1023/A:1009813105532
  20. Lenstra J.K., D.B. Shmoys, and E. Tardos, Approximation Algorithms for Scheduling Unrelated Parallel Machines, Mathematical Programming, Vol.46(1990), pp.259-271 https://doi.org/10.1007/BF01585745
  21. Potts C.N., Analysis of a linear programming euristic for scheduling unrelated parallel machines, Discrete Appl. Math. Vol. 10(1985), pp.155-164 https://doi.org/10.1016/0166-218X(85)90009-5
  22. Shchepinal E.V. and N. Vakhania, An optimal rounding gives a better approximation for scheduling unrelated machines, Operations Research Letters, Vol.33(2005), pp. 127-133 https://doi.org/10.1016/j.orl.2004.05.004
  23. Vairaktarakis, G.L. and X. Cai, The Value of Processing Flexibility in Multipurpose Machines, IIE Transactions, Vol.35(2003), pp.763-774 https://doi.org/10.1080/07408170304349
  24. Yu, L., Scheduling of unrelated parallel machines： an application to PWB manufacturing, IIE Transactions, Vol.34(2003), pp. 921-931
  25. M. Yue, On the exact upper bound for the MULTIFIT processor scheduling algorithm, in Operations Research in China, M. Yue (ed.), of Annals of Operations Research, Baltzer, Basel, Switzerland, Vol.24(1990), pp. 233-259 https://doi.org/10.1007/BF02216826