Flow shop scheduling with effects of learning and deterioration

Journal of Applied Mathematics and Computing

Volumn 26, Issue 1-2, 2008, Pages 367-379

  Wang, Ji Bo ^a   Lin, Lin ^a   Shan, Feng ^a  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

Author keywords

Deteriorating jobs; Flow shop; Learning effect; Scheduling

Indexed keywords

EID: 49249100022     PISSN: 15985865     EISSN: None     Source Type: Journal    
DOI: 10.1007/s12190-007-0033-0     Document Type: Article

References (31)

1. 1. A. Bachman A. Janiak 2000 Minimizing maximum lateness under linear deterioration Eur. J. Oper. Res. 126 557 566 0976.90039 10.1016/S0377-2217(99)00310-0 1782181 Bachman, A., Janiak, A.: Minimizing maximum lateness under linear deterioration. Eur. J. Oper. Res. 126, 557–566 (2000)
2. 2. A. Bachman A. Janiak 2004 Scheduling jobs with position-dependent processing times J. Oper. Res. Soc. 55 257 264 1095.90033 10.1057/palgrave.jors.2601689 Bachman, A., Janiak, A.: Scheduling jobs with position-dependent processing times. J. Oper. Res. Soc. 55, 257–264 (2004)
3. 3. A. Bachman T.C.E. Cheng A. Janiak C.T. Ng 2002 Scheduling start time dependent jobs to minimize the total weighted completion time J. Oper. Res. Soc. 53 688 693 1059.90063 10.1057/palgrave.jors.2601359 Bachman, A., Cheng, T.C.E., Janiak, A., Ng, C.T.: Scheduling start time dependent jobs to minimize the total weighted completion time. J. Oper. Res. Soc. 53, 688–693 (2002)
4. 4. A. Bachman A. Janiak M.Y. Kovalyov 2002 Minimizing the total weighted completion time of deteriorating jobs Inf. Process. Lett. 81 81 84 1032.68019 10.1016/S0020-0190(01)00196-X 1873308 Bachman, A., Janiak, A., Kovalyov, M.Y.: Minimizing the total weighted completion time of deteriorating jobs. Inf. Process. Lett. 81, 81–84 (2002)
5. 5. A.B. Badiru 1992 Computational survey of univariate and multivariate learning curve models IEEE Trans. Eng. Manag. 39 176 188 10.1109/17.141275 Badiru, A.B.: Computational survey of univariate and multivariate learning curve models. IEEE Trans. Eng. Manag. 39, 176–188 (1992)
6. 6. D. Biskup 1999 Single-machine scheduling with learning considerations Eur. J. Oper. Res. 115 173 178 0946.90025 10.1016/S0377-2217(98)00246-X Biskup, D.: Single-machine scheduling with learning considerations. Eur. J. Oper. Res. 115, 173–178 (1999)
7. 7. S. Browne U. Yechiali 1990 Scheduling deteriorating jobs on a single processor Oper. Res. 38 495 498 0703.90051 Browne, S., Yechiali, U.: Scheduling deteriorating jobs on a single processor. Oper. Res. 38, 495–498 (1990)
8. 8. T.C.E. Cheng G. Wang 2000 Single machine scheduling with learning effect considerations Ann. Oper. Res. 98 273 290 0967.68019 10.1023/A:1019216726076 1839885 Cheng, T.C.E., Wang, G.: Single machine scheduling with learning effect considerations. Ann. Oper. Res. 98, 273–290 (2000)
9. 9. T.C.E. Cheng Q. Ding B.M.T. Lin 2004 A concise survey of scheduling with time-dependent processing times Eur. J. Oper. Res. 152 1 13 1030.90023 10.1016/S0377-2217(02)00909-8 2004434 Cheng, T.C.E., Ding, Q., Lin, B.M.T.: A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152, 1–13 (2004)
10. 10. R.L. Graham E.L. Lawler J.K. Lenstra A.H.G. Rinnooy Kan 1979 Optimization and approximation in deterministic sequencing and scheduling: a survey Ann. Discrete Math. 5 287 326 0411.90044 558574 Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)
11. 11. K.I.-J. Ho J.Y.-T. Leung W.-D. Wei 1993 Complexity of scheduling tasks with time-dependent execution times Inf. Process. Lett. 48 315 320 0942.68508 10.1016/0020-0190(93)90175-9 1259643 Ho, K.I.-J., Leung, J.Y.-T., Wei, W.-D.: Complexity of scheduling tasks with time-dependent execution times. Inf. Process. Lett. 48, 315–320 (1993)
12. 12. W.-C. Lee 2004 A note on deteriorating jobs and learning in single-machine scheduling problems Int. J. Bus. Econ. 3 83 89 Lee, W.-C.: A note on deteriorating jobs and learning in single-machine scheduling problems. Int. J. Bus. Econ. 3, 83–89 (2004)
13. 13. G. Mosheiov 1991 V-shaped policies for scheduling deteriorating jobs Oper. Res. 39 979 991 0748.90033 1139967 Mosheiov, G.: V-shaped policies for scheduling deteriorating jobs. Oper. Res. 39, 979–991 (1991)
14. 14. G. Mosheiov 1994 Scheduling jobs under simple linear deterioration Comput. Oper. Res. 21 653 659 0810.90074 10.1016/0305-0548(94)90080-9 Mosheiov, G.: Scheduling jobs under simple linear deterioration. Comput. Oper. Res. 21, 653–659 (1994)
15. 15. G. Mosheiov 2002 Complexity analysis of job-shop scheduling with deteriorating jobs Discrete Appl. Math. 117 195 209 1004.68031 10.1016/S0166-218X(00)00385-1 1881277 Mosheiov, G.: Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl. Math. 117, 195–209 (2002)
16. 16. G. Mosheiov 2001 Scheduling problems with a learning effect Eur. J. Oper. Res. 132 687 693 1017.90051 10.1016/S0377-2217(00)00175-2 1832521 Mosheiov, G.: Scheduling problems with a learning effect. Eur. J. Oper. Res. 132, 687–693 (2001)
17. 17. G. Mosheiov 2001 Parallel machine scheduling with a learning effect J. Oper. Res. Soc. 52 1165 1169 02146768 10.1057/palgrave.jors.2601215 Mosheiov, G.: Parallel machine scheduling with a learning effect. J. Oper. Res. Soc. 52, 1165–1169 (2001)
18. 18. G. Mosheiov J.B. Sidney 2003 Scheduling with general job-dependent learning curves Eur. J. Oper. Res. 147 665 670 1037.90529 10.1016/S0377-2217(02)00358-2 1965663 Mosheiov, G., Sidney, J.B.: Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 147, 665–670 (2003)
19. 19. D.A. Nembhard N. Osothsilp 2002 Task complexity effects on between-individual learning/forgetting variability Int. J. Ind. Ergon. 29 297 306 10.1016/S0169-8141(01)00070-1 Nembhard, D.A., Osothsilp, N.: Task complexity effects on between-individual learning/forgetting variability. Int. J. Ind. Ergon. 29, 297–306 (2002)
20. 20. C.T. Ng T.C.E. Cheng A. Bachman A. Janiak 2002 Three scheduling problems with deteriorating jobs to minimize the total completion time Inf. Process. Lett. 81 327 333 10.1016/S0020-0190(01)00244-7 1879800 Ng, C.T., Cheng, T.C.E., Bachman, A., Janiak, A.: Three scheduling problems with deteriorating jobs to minimize the total completion time. Inf. Process. Lett. 81, 327–333 (2002)
21. 21. M. Pinedo 1995 Scheduling: Theory, Algorithms, and Systems Prentice-Hall Englewood Cliffs 1145.90393 Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs (1995)
22. 22. J.-B. Wang 2005 Flow shop scheduling jobs with position-dependent processing times J. Appl. Math. Comput. 18 383 391 2137717 10.1007/BF02936581 Wang, J.-B.: Flow shop scheduling jobs with position-dependent processing times. J. Appl. Math. Comput. 18, 383–391 (2005)
23. 23. J.-B. Wang 2006 A note on scheduling problems with learning effect and deteriorating jobs Int. J. Syst. Sci. 37 827 833 1126.90347 10.1080/00207720600879260 Wang, J.-B.: A note on scheduling problems with learning effect and deteriorating jobs. Int. J. Syst. Sci. 37, 827–833 (2006)
24. 24. J.-B. Wang 2007 Single-machine scheduling problems with the effects of learning and deterioration Omega—Int. J. Manag. Sci. 35 397 402 10.1016/j.omega.2005.07.008 Wang, J.-B.: Single-machine scheduling problems with the effects of learning and deterioration. Omega—Int. J. Manag. Sci. 35, 397–402 (2007)
25. 25. J.-B. Wang T.C.E. Cheng 2007 Scheduling problems with the effects of deterioration and learning Asia-Pac. J. Oper. Res. 24 245 261 10.1142/S021759590700122X 2320107 Wang, J.-B., Cheng, T.C.E.: Scheduling problems with the effects of deterioration and learning. Asia-Pac. J. Oper. Res. 24, 245–261 (2007)
26. 26. J.-B. Wang Z.-Q. Xia 2005 No-wait or no-idle permutation flowshop scheduling with dominating machines J. Appl. Math. Comput. 17 419 432 1138.90400 2108817 Wang, J.-B., Xia, Z.-Q.: No-wait or no-idle permutation flowshop scheduling with dominating machines. J. Appl. Math. Comput. 17, 419–432 (2005)
27. 27. J.-B. Wang Z.-Q. Xia 2005 Scheduling jobs under decreasing linear deterioration Inf. Process. Lett. 94 63 69 10.1016/j.ipl.2004.12.018 2126530 Wang, J.-B., Xia, Z.-Q.: Scheduling jobs under decreasing linear deterioration. Inf. Process. Lett. 94, 63–69 (2005)
28. 28. J.-B. Wang Z.-Q. Xia 2005 Flow-shop scheduling with a learning effect J. Oper. Res. Soc. 56 1325 1330 1082.90041 10.1057/palgrave.jors.2601856 2124582 Wang, J.-B., Xia, Z.-Q.: Flow-shop scheduling with a learning effect. J. Oper. Res. Soc. 56, 1325–1330 (2005)
29. 29. J.-B. Wang Z.-Q. Xia 2006 Flow shop scheduling with deteriorating jobs under dominating machines Omega—Int. J. Manag. Sci. 34 327 336 10.1016/j.omega.2004.10.006 2195315 Wang, J.-B., Xia, Z.-Q.: Flow shop scheduling with deteriorating jobs under dominating machines. Omega—Int. J. Manag. Sci. 34, 327–336 (2006)
30. 30. J.-B. Wang Z.-Q. Xia 2006 Flow shop scheduling problems with deteriorating jobs under dominating machines J. Oper. Res. Soc. 57 220 226 1090.90095 Wang, J.-B., Xia, Z.-Q.: Flow shop scheduling problems with deteriorating jobs under dominating machines. J. Oper. Res. Soc. 57, 220–226 (2006)
31. 31. J.-B. Wang A.-X. Guo F. Shan B. Jiang L.-Y. Wang 2007 Single machine group scheduling under decreasing linear deterioration J. Appl. Math. Comput. 24 283 293 1148.90326 10.1007/BF02832317 2311965 Wang, J.-B., Guo, A.-X., Shan, F., Jiang, B., Wang, L.-Y.: Single machine group scheduling under decreasing linear deterioration. J. Appl. Math. Comput. 24, 283–293 (2007)