skip to main content
10.1145/3056662.3056715acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicscaConference Proceedingsconference-collections
research-article

Minimizing makespan in a single machine scheduling problem with deteriorating jobs and learning effects

Published:26 February 2017Publication History

ABSTRACT

This paper considers a single machine scheduling problem with simultaneous deteriorating jobs and learning effects. It is proved in the literature that the single machine scheduling problem with linear deterioration rate and learning effect is NP-hard in strong sense. Therefore, due to complexity of the problem finding the best sequence of jobs with minimum Makespan using Full Enumeration methods is time consuming and costly. Therefore, a new polynomial time heuristic algorithm is proposed to solve the problem in different sizes. The performance of the heuristic algorithm is evaluated against classical Smallest Deterioration Rate and Full Enumeration methods in solving various test problems. For this purpose, different measures including Percentage Relative Error and CPU_Time are considered to demonstrate the superior solution method. In addition, Single Factor ANOVA and Tukey's multiple comparison test are utilized to find significant differences in performance of the solution methods.

References

  1. W.C. Lee, C.C. Wu, "Multi-machine scheduling with deteriorating jobs and scheduled maintenance", Appl. Math. Model., vol. 32, Mar. 2008, pp. 362--373 Google ScholarGoogle ScholarCross RefCross Ref
  2. E. G. Coffman, Jr, M. R. Garey, D. S. Johnson, "An application of bin-packing to multiprocessor scheduling". SIAM J. on Comput, vol. 7, Feb. 1978, pp. 1--17 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. W.C. Lee, C.C. Wu, "A note on single-machine group scheduling problems with position-based learning effect", Appl. Math. Model., vol. 33, Apr. 2009, pp. 2159--2163 Google ScholarGoogle ScholarCross RefCross Ref
  4. T.C.E. Cheng, C.C. Wu, W.C. Lee, "Some scheduling problems with deteriorating jobs and learning effects", Comput. and Indust. Eng, vol. 54, May. 2008, pp. 972--982 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. P. Liu, L. Tang, X. Zhou, "Two-agent group scheduling with deteriorating jobs on a single machine", Int. J. of Adv. Manuf. Tech, vol. 47, Mar. 2010, pp. 657--664 Google ScholarGoogle ScholarCross RefCross Ref
  6. J.B. Wang, "Single machine scheduling with a time-dependent learning effect and deteriorating jobs", J. of the Operat. Res. Soc, vol. 60, Apr. 2009, pp. 583--586 Google ScholarGoogle ScholarCross RefCross Ref
  7. J.B. Wang, Y. Jiang, G. Wang, 2009. "Single machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning", Int. J. of Adv. Manuf. Tech, vol. 41, Apr. 2009, pp. 1221--1226 Google ScholarGoogle ScholarCross RefCross Ref
  8. J.B. Wang, Q. Guo, 2010. "A due-date assignment problem with learning effect and deteriorating jobs", Appl. Math. Model., vol. 34, Feb. 2010, pp. 309--313 Google ScholarGoogle ScholarCross RefCross Ref
  9. X. Huang, M.Z. Wang, J.B. Wang, "Single-machine group scheduling with both learning effects and deteriorating jobs". Comput. and Indust. Eng, vol. 60, May. 2011, pp. 750--754 Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J.B Wang, D. Wang, G.D. Zhang,. "Single-machine scheduling problems with both deteriorating jobs and learning effects", Appl. Math. Model., vol. 34, Oct. 2010, pp 2831--2839 Google ScholarGoogle ScholarCross RefCross Ref
  11. J. J. Kanet, "Minimizing variation of flow time in single machine systems". Manag. Sci, vol. 27, Dec. 1981, pp. 1453--1459 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J.B. Wang, M.Z. Wang,. "Single-machine scheduling with nonlinear deterioration", Opt. Lett. vol. 6, Jan. 2012, pp. 87--98, doi: 0.1007/s11590-010-0253-3.Google ScholarGoogle ScholarCross RefCross Ref
  13. Y. Yin, T.C.E. Cheng, L. Wan, C.C. Wu, J. Liu, "Two-agent single-machine scheduling with deteriorating jobs". Comput. and Indust. Eng, vol. 81, Mar. 2015, pp. 177--185 Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P. Guo, W. Chen, Y. Wang, "A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs", arXiv preprint arXiv:1301.7134.Google ScholarGoogle Scholar
  15. C. Zhao, H. Tang, "Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs". Comput. and Indust. Eng, vol. 59, Nov. 2010, pp. 663--666 Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. S. H. Pakzad-Moghaddam, H. Mina, R. Tavakkoli-Moghaddam, "An approach for modeling a new single machine scheduling problem with deteriorating and learning effects". Comput. and Indust. Eng, vol. 78, Dec. 2014, pp. 33--43 Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. W.C. Lee, "A note on deteriorating jobs and learning in single-machine scheduling problems". Int. J. of Bus. and Econ, vol. 3, Jan. 2004, pp. 83--89.Google ScholarGoogle Scholar
  18. M. Ji, C.J. Hsu, D. L. Yang, "Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration". J. of Comb. Optim, (3), vol. 26, Oct. 2013, pp. 437--447 Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A. Bachman, A. Janiak, "Minimizing maximum lateness under linear deterioration". Euro. J. of Oper. Res, (3), vol. 126, Nov. 2000, pp. 557--566 Google ScholarGoogle ScholarCross RefCross Ref
  20. D. Wang, J.B. Wang, "Single-machine scheduling with simple linear deterioration to minimize earliness penalties". The Int. J. of Adv. Manuf. Tech,, (1--4), vol. 46, Jan. 2010, pp. 285--290 Google ScholarGoogle ScholarCross RefCross Ref
  21. S. Khalilpourazari, S.H.R. Pasandideh, "Multi-item EOQ model with nonlinear unit holding cost and partial backordering: moth-flame optimization algorithm". J of Indust. and Prod. Eng, Jun 2016, pp. 1--10 Google ScholarGoogle ScholarCross RefCross Ref
  22. S. Khalilpourazari, S.H.R. Pasandideh, S.T.A. Niaki, "Optimization of multi-product economic production quantity model with partial backordering and physical constraints: SQP, SFS, SA, and WCA". Appl. Soft. Comput. Sep 2016 Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. S. Khalilpourazari, M. Mohammadi, "Optimization of closed-loop Supply chain network design: a Water Cycle Algorithm approach". 12th Int. Conf. on Indust. Eng. IEEE. Jan. 2016, pp. 41--45 Google ScholarGoogle ScholarCross RefCross Ref
  24. S. Khalilpourazari, S.H.R. Pasandideh, "Bi-objective optimization of multi-product EPQ model with backorders, rework process and random defective rate". 12th Int. Conf. on Indust. Eng. IEEE. Jan. 2016b, pp. 36--40 Google ScholarGoogle ScholarCross RefCross Ref
  25. S. Khalilpourazari, S. Khalilpourazary, "A lexicographic weighted Tchebycheff approach for multi-constrained multi-objective optimization of the surface grinding process". Eng. Optimiz. Aug 2016, pp. 1--18 Google ScholarGoogle ScholarCross RefCross Ref
  26. S. Khalilpourazari, S. Khalilpourazary, "Optimization of production time in the multi-pass milling process via a Robust Grey Wolf Optimizer". Neural Comput & Applic. 2016 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Minimizing makespan in a single machine scheduling problem with deteriorating jobs and learning effects

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        ICSCA '17: Proceedings of the 6th International Conference on Software and Computer Applications
        February 2017
        339 pages
        ISBN:9781450348577
        DOI:10.1145/3056662

        Copyright © 2017 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 26 February 2017

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader