Minimizing total completion time in a two-machine flowshop with a learning effect

International Journal of Production Economics

Volumn 88, Issue 1, 2004, Pages 85-93

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

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Flowshop; Learning effect; Total completion time; Two machine

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; JOB ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

FLOWSHOPS; LEARNING EFFECTS; TOTAL COMPLETION TIME; TWO-MACHINE;

PRODUCTION CONTROL;

EID: 0742284281     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(03)00179-8     Document Type: Article

References (17)

1. Allahverdi A., Aldowaisan T. New heuristic to minimize total completion time in. m -machine flowshops International Journal of Production Economics. 77:2002;71-83.
2. Biskup D. Single-machine scheduling with learning considerations. European Journal of Operational Research. 115:1999;173-178.
3. Cadambi B.V., Sathe Y.S. Two-machine flowshop scheduling to minimise mean flow time. Operations Research. 30:1993;35-41.
4. Chung C.S., Flynn J., 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. Croce F.D., Narayan V., Tadei R. The two-machine total completion time flow shop problem. European Journal of Operational Research. 90:1996;227-237.
6. Croce F.D., Ghirardi M., Tadei R. An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. European Journal of Operational Research. 139:2002;293-301.
7. Gonzalez T., Sahni S. Flowshop and jobshop schedules. Complexity and approximation Operations Research. 26(1):1978;36-52.
8. Hoogeveen H., Kawaguchi T. Minimizing total completion time in a two-machine flowshop. Analysis of special cases Mathematics of Operations Research. 24:1999;887-913.
9. Ignall E., Schrage L.E. Application of the branch and bound technique to some flowshop scheduling problems. Operations Research. 13:1965;400-412.
10. Kohler W.H., Steiglitz K. Exact, approximate and guaranteed accuracy algorithms for the flowshop scheduling problem n/2/F/. F̄ Journal of Association for Computing Machinery. 22:1975;106-114.
11. Moore J.M. An n job one machine sequencing algorithm for minimizing the number of late jobs. Management Science. 15:1968;102-109.
12. Mosheiov G. Scheduling problems with a learning effect. European Journal of Operational Research. 132:2001;687-693.
13. Pan C.H., Wu C.C. An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop. International Journal of System Science. 27:1996;925-930.
14. Smith W.E. Various optimizers for single-stage production. Naval Research Logistics Quarterly. 3:1956;59-66.
15. i scheduling problems International Journal of Production Economics. 44:1996;225-237.
16. Wright T.P. Factors affecting the cost of airplanes. Journal of Aeronautical Sciences. 3:1936;122-128.
17. Xiang S., Tang G., Cheng T.C.E. Solvable cases of permutation flowshop scheduling with dominating machines. International Journal of Production Economics. 66:2000;53-57.