Scheduling Problems with Human and Machine Effects

Article Preview

Abstract:

We discuss single machine scheduling problems with learning effects of setup and removal times and deterioration effects of processing time, i.e., the processing (setup or removal) time of a job is a function of its position . The objective functions are finding the optimal sequence of jobs to minimize a cost function containing makespan, total completion time and total absolute differences in completion times and to minimize a cost function containing makespan, total waiting time and total absolute differences in waiting times. The problems are modeled as an assignment problem respectively, and thus can be solved in polynomial time.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2206-2210

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Allahverdi , A., Gupta, J.N.D. and Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27: 219-239.

DOI: 10.1016/s0305-0483(98)00042-5

Google Scholar

[2] Allahverdi , A., Ng, C.T., Cheng, T.C.E. & Kovalyov, M.Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187: 985-1032.

DOI: 10.1016/j.ejor.2006.06.060

Google Scholar

[3] Bagchi, U.B. (1989). Simultaneous minimization of mean and variation of flow-time and waiting time in single machine systems. Operations Research , 37: 118-125.

DOI: 10.1287/opre.37.1.118

Google Scholar

[4] Bai, J., Li, Z. -R., & Huang, X. (2012). Single-machine group scheduling with general deterioration and learning effects. Applied Mathematical Modelling. Applied Mathematical Modelling , 36: 1267-1274.

DOI: 10.1016/j.apm.2011.07.068

Google Scholar

[5] Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115: 173-178.

DOI: 10.1016/s0377-2217(98)00246-x

Google Scholar

[6] Eren, T. (2008). A bicriteria parallel machine scheduling with a learning effect of setup and removal times. Applied Mathematical Modelling, 33(2), 1141-1150.

DOI: 10.1016/j.apm.2008.01.010

Google Scholar

[7] Eren, T (2009). Human and machine effects in a just-in-time scheduling problem. Human Factors and Ergonomics in Manufacturing, 19 (4), 294-299.

DOI: 10.1002/hfm.20160

Google Scholar

[8] Mosheiov , G. (2008). Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines. Journal of the Operational Research Society, 59, 1422-1424.

DOI: 10.1057/palgrave.jors.2602480

Google Scholar

[9] Kanet, J.J. (1981). Minimization variation of flow time in single machine system. Management Science, 27(12), 1453-1459.

DOI: 10.1287/mnsc.27.12.1453

Google Scholar

[10] Lee, W. -C., Wu, C. -C., Wen, C. -C., & Chung, Y. -H. (2008) . A two-machine flowshop makespan scheduling problem with deteriorating jobs. Computers & Industrial Engineering, 54(4), 737-749.

DOI: 10.1016/j.cie.2007.10.010

Google Scholar

[11] Li, Y., Li, G., Sun, L., & Xu Z. (2009). Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times. International Journal of Production Economics, 118: 424-429.

DOI: 10.1016/j.ijpe.2008.11.011

Google Scholar

[12] Yang, S. -J., Hsu, C. -J. & Yang, D. -L. (2010) . Parallel-machine scheduling with setup and removal times under consideration of the learning effect. Journal of the Chinese Institute of Industrial Engineers, 27: 372-378.

DOI: 10.1080/10170669.2010.503040

Google Scholar