Flow-shop scheduling with a learning effect

Journal of the Operational Research Society

Volumn 56, Issue 11, 2005, Pages 1325-1330

  Wang, J B ^a,b   Xia, Z Q ^b  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Flow shop; Learning effect; Schheduling; Worst case analysis

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INDUSTRIAL MANAGEMENT; PROCESS CONTROL; SCHEDULING;

FLOW SHOP; FLOWTIME; LEARNING EFFECT; WORT-CASE ANALYSIS;

PROBLEM SOLVING;

EID: 27144431696     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601856     Document Type: Article

References (25)

1. Wright TP (1936). Factors affecting the cost of airplanes. J Aeronaut Sci 3: 122-128.
2. Biskup D (1999). Single-machine scheduling with learning considerations. Eut J Opl Res 115: 173-178.
3. Mosheiov G (2001). Scheduling problems with a learning effect. Eur J Opl Res 132: 687-693.
4. Mosheiov G (2001). Parallel machine scheduling with a learning effect, J Opl Res Soc 52: 1165-1169.
5. Mosheiov G and Sidney JB (2003). Scheduling with general jobdependent learning curves. Eur J Opl Res 147: 665-670.
6. Bachman A and Janiak A (2004). Scheduling jobs with position-dependent processing times. J Opl Res Soc 55: 257-264.
7. Garey MR and Johnson DS (1979). Computers and Intractability: A Guided Tour to the Theory of NP-completeness. Freeman: San Francisco.
8. Campbell HG, Dudek RA and Smith ML (1970). A heuristic algorithm for n job m machine sequencing problem. Mngt Sci 16: 630-637.
9. Dannenbring DG (1977). An evaluation of flow-shop sequencing heuristics. Mngt Sci 23: 1174-1182.
10. Gonzalez T and Sahni S (1978). Flowshop and jobshop schedules: complexity and approximation. Opns Res 26: 36-52.
11. Smutnicki C (1998). Some results of the worst-case analysis for flow shop scheduling. Eur J Opl Res 109: 66-87.
12. Monma CL and Rinnooy Kan AHG (1983). A concise survey of efficient solvable special cases of the permutation flowshop problem. RAIRO 17: 105-119.
13. van den Nouweland A, Krabbenborg M and Potters J (1992). Flow-shops with a dominant machine. Eur J Opl Res 62: 38-46.
14. Ho JC and Gupta JND (1995). Flowshop scheduling with dominant machines. Comput Opns Res 22: 237-246.
15. Xiang S, Tang G and Cheng TCE (2000). Solvable cases of permutation flowshop scheduling with dominating machines. Int J Prod Econ 66: 53-57.
16. Čepek O, Okada M and Vlach M (2002). Nonpreemptive flowshop scheduling with machine dominance. Eur J Opl Res 139: 245-261.
17. Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5: 287-326.
18. Thomas HR, Mathews CT and Ward JG (1986). Learning curve models of construction productivity. J Constr Eng Mngt ASCE 112: 245-258.
19. Johnson SM (1954). Optimal two-and-three-stage production schedules. Naval Res Logist 1: 61-68.
20. Pinedo M (1995). Scheduling: Theory, Algorithms and Systems. Prentice-Hall: Englewood Cliffs, NJ.
21. Baker KR (1974). Introduction to Sequencing and Scheduling. Wiley: New York.
22. Badiru AB (1992). Computational survey of univariate and multivariate learning curve models. IEEE Trans Eng Mngt 39: 176-188.
23. Dejong JR (1957). The effects of increasing skill on cycle time and its consequences for time standards. Ergonomics 1: 51-60.
24. Pegels CC (1969). On start-up or learning curves: an expanded view. AIIE Trans 1: 316-322.
25. Forst FG (1995). Bicriterion stochastic scheduling on one or more machines. Eur J Opl Res 80: 404-409.