A note on the total completion time problem in a permutation flowshop with a learning effect

European Journal of Operational Research

Volumn 192, Issue 1, 2009, Pages 343-347

  Wu, Chin Chia ^a   Lee, Wen Chiung ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Flowtime; Learning effect; Permutation flowshop; Scheduling

Indexed keywords

FLOWTIME; LEARNING EFFECT; LEARNING EFFECTS; PERMUTATION FLOWSHOP; SCHEDULING;

EDUCATION;

EID: 51049094449     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.10.003     Document Type: Article

References (15)

1. Bansal S.P. Minimizing the sum of completion times of n jobs over m machines in a flowshop - a branch and bound approach. AIIE Transactions 9 (1977) 306-311
2. Biskup D. Single-machine scheduling with learning considerations. European Journal of Operational Research 115 (1999) 173-178
3. Biskup D. A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research (2007) 10.1016/j.ejor.2007.05.040
4. Chung C.S., Flynn J., and Kirca O. A branch-and-bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. International Journal of Production Economics 79 (2002) 185-196
5. Framinan J.M., and Leisten R. An efficient constructive heuristic for flowtime minimization in permutation flow shops. OMEGA: The International Journal of Management Science 31 (2003) 311-317
6. Framinan, J.M., Leisten R., Gupta, J.N.D., 2001. A review and classification heuristics for permutation flow shop scheduling with makespan objective. Technical Report, Industrial Management. University of Seville.
7. Framinan J.M., Leisten R., and Ruiz-Usano R. Comparison of heuristics for flowtime minimization in permutation flowshops. Computers and Operations Research 32 (2005) 1237-1254
8. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
9. i scheduling problem. European Journal of Operational Research 132 (2001) 439-452
10. Mosheiov G. Scheduling problems with a learning effect. European Journal of Operational Research 132 (2001) 687-693
11. Mosheiov G., and Sidney J.B. Scheduling with general job-dependent learning curves. European Journal of Operational Research 147 (2003) 665-670
12. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA: The International Journal of Management Science 11 (1983) 91-95
13. Rajendran C., and Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research 103 (1997) 129-138
14. Wang J.B., and Xia Z.Q. Flow-shop scheduling with a learning effect. Journal of the Operational Research Society 56 (2005) 1325-1330
15. Woo D.S., and Yim H.S. A heuristic algorithm for mean flowtime objective in scheduling. Computers and Operations Research 25 (1998) 175-182