Parametric analysis of bi-criterion single machine scheduling with a learning effect

International Journal of Innovative Computing, Information and Control

Volumn 4, Issue 8, 2008, Pages 2033-2043

  Chang, Pei Chann ^a   Chen, Shih Hsin ^b   Mani, V ^c  

^a YUAN ZE UNIVERSITY   (Taiwan)

^b NANHUA UNIVERSITY   (Taiwan)

^c INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Bi criterion problem; Learning effect; Parametric analysis; Single machine scheduling

Indexed keywords

EID: 63649102095     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. A. Bachman and A. Janiak, Scheduling jobs with position-dependent processing times, Journal of the Operational Research Society, vol.55, no.3, pp.257-264, 2004.
2. U. Bagchi, Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems, Operations Research, vol.37, no.1, pp.118-125, 1989.
3. K. R. Baker, Introduction to Sequencing and Scheduling, John Wiley & Sons, New York, 1974.
4. D. Biskup, Single-machine scheduling with learning considerations, European Journal of Operational Research, vol.115, no.1, pp.173-178, 1999.
5. D. Biskup and D. Simons, Common due date scheduling with autonomous and induced learning, European Journal of Operational Research, vol.159, no.3, pp.606-616, 2004.
6. C. Capi, M. Yokota and K. Mitobe, Optimal multi-criterion humanoid robot gait synthesis - An evolutionary approach, International Journal of Innovative Computing, Information and Control, vol.2, no.6, pp.1249-1258, 2006.
7. T. C. E. Cheng, Optimal single machine sequencing and assignment of common due-dates, Computers and Industrial Engineering, vol.22, no.2, pp.115-120, 1992.
8. W. H. Kuo and D. L. Yang, Minimizing the makespan in a single machine scheduling problem with a time based learning effect, Information Processing Letters, vol.97, no.2, pp.64-67, 2006.
9. W. C. Lee, C. C. Wu and H. J. Sung, A bi-criterion single-machine scheduling problem with learning considerations, Acta Informatica, vol.40, no.4, pp.303-315, 2004.
10. W. C. Lee and C. C. Wu, Minimizing total completion time in a two-machine flowshop with a learning effect, International Journal of Production Economics, vol.88, no.l, pp.85-93, 2004.
11. G. Mosheiov, Scheduling problems with a learning effect, European Journal of Operational Research, vol.132, no.3, pp.687-693, 2001.
12. G. Mosheiov, Parallel machine scheduling with a learning effect, Journal of the Operational Research Society, vol.52, no.10, pp.1165-1169, 2001.
13. G. Mosheiov and J. B. Sidney, Note on scheduling with general learning curves to minimize the number of tardy jobs, Journal of the Operational Research Society, vol.56, no.1, pp.110-112, 2005.
14. S. S. Panwalkar, M. L. Smith and A. Seidmann, Common due-date assignment to minimize total penalty for the one machine scheduling problem, Operations Research, vol.30, no.2, pp.391-399, 1982.
15. J. B. Wang and Z. Q. Xia, Flowshop scheduling with a learning effect, Journal of the Operational Research Society, vol.56, no.11, pp.1325-1330, 2005.
16. T. P. Wright, Factors affecting the cost of airplanes, Journal of Aeronautical Science, vol.3, no.2, pp. 122-128, 1936.
17. C. C. Wu, W. C. Lee and T. Chen, Heuristic algorithms for solving the maximum lateness scheduling problem with considerations, Computers and Industrial Engineering, vol.52, no.1, pp.124-132, 2007.
18. L. E. Yelle, The learning Curve: Historical review and comprehensive survey, Decision Science, vol.10, no.2, pp.302-328, 1979.
19. J. R. Yu, IDEA by multi objective programming, International Journal of Innovative Computing, Information and Control, vol.3, no.1, pp.21-29, 2007.