A bi-criteria two-machine flowshop scheduling problem with a learning effect

Journal of the Operational Research Society

Volumn 57, Issue 9, 2006, Pages 1113-1125

  Chen, P ^a   Wu, C C ^a   Lee, W C ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Learning effect; Maximum tardiness; Scheduling; Total completion time; Two machine flowshop

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; LEARNING SYSTEMS; MACHINE DESIGN; OPERATIONS RESEARCH; PROBLEM SOLVING;

HEURISTIC ALGORITHMS; LEARNING EFFECT; MAXIMUM TARDINESS; TOTAL COMPLETION TIME; TWO-MACHINE FLOWSHOP;

SCHEDULING;

EID: 33747152563     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602095     Document Type: Article

References (22)

1. Biskup D (1999). Single-machine scheduling with learning considerations. Eut J Opl Res 115: 173-178.
2. Cheh KM, Goldberg JB and Askin RG (1991). A note on the effect of neighborhood structure in simulated annealing. Comput Oper Res 18: 537-547.
3. Dileepan P and Sen T (1988). Bicriterion static scheduling research for a single machine. Omega 16: 53-59.
4. Fisher ML (1971). A dual algorithm for the one-machine scheduling problem. Math Program 11: 229-251.
5. Garey MR, Johnson DS and Sethi PR (1979). The complexity of flowshop and jobshop scheduling. Math Opl Res 1: 117-129.
6. Heiser J and Render B (1999). Operations Management, 5th edn. Prentice Hall: Englewood Cliffs, NJ.
7. Karasakal EK and Köksalan M (2000). A simulated annealing approach to bicriteria scheduling problems on a single machine. J Heurist 6: 311-327.
8. Kirkpatrick S, Gellat CD and Vecchi MP (1983). Optimization by simulated annealing algorithm. Science 220: 671-680.
9. Koulamas C, Antony SR and Jaen R (1994). A survey of simulated annealing applications to operations research problems. Omega 22: 41-56.
10. Lee WC and Wu CC (2004). Minimizing total completion time in a two-machine flowshop with a learning effect. Int J Prod Econom 88: 85-93.
11. Lee WC, Wu CC and Sung HJ (2004). A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica 40: 303-315.
12. Lenstra JK, Rinnooy AHG and Brucker P (1977). Complexity of machine scheduling problems. Ann Discr Math 1: 1016-1019.
13. Mosheiov G (2001a). Scheduling problems with a learning effect. Eur J Opl Res 132: 687-693.
14. Mosheiov G (2001 b). Parallel machine scheduling with a learning effect. J Opl Res Soc 52: 1165-1169.
15. Mosheiov G and Sidney J (2003). Scheduling with general jobdependent learning curves. Eur J Opl Res 147: 665-670.
16. Nagar A, Haddock J and Heragu S (1995a). Multiple and bicriteria scheduling: a literature survey. Eur J Opl Res 81: 88-104.
17. Nagar A, Heragu SS and Haddock J (1995b). A branch-and-bound approach for a two-machine flowshop scheduling problem. J Opl Res Soc 46: 721-734.
18. Panwalker SS and Iskander W (1977). A survey of scheduling rules. Oper Res 25: 45-61.
19. Ruiz-Torres AJ, Enscore EE and Barton RR (1997). Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem. Comput Ind Eng 33: 257-260.
20. Russell R and Taylor III BW (2000). Operations Management: Multimedia Version, 3rd edn. Prentice-Hall: Upper Saddle River, NJ.
21. Wright TP (1936). Factors affecting the cost of airplanes. J Aeronaut Sci 3: 122-128.
22. Yelle LE (1979). The learning curve: historical review and comprehensive survey. Decis Sci 10: 302-328.