Stochastic procedures for scheduling minimum job sets on mixed model assembly lines

Journal of the Operational Research Society

Volumn 48, Issue 5, 1997, Pages 490-501

  Bolat, A ^a  

^a KING SAUD UNIVERSITY   (Saudi Arabia)

Author keywords

Heuristics; Lower bounds; Paced line; Sequencing; Simulated annealing

Indexed keywords

HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PRODUCTION; SCHEDULING; SIMULATED ANNEALING;

LOWER BOUNDS; MIXED MODEL ASSEMBLY LINES; PACED LINE; SEQUENCING; STOCHASTIC ALGORITHMS;

ALGORITHMS;

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

References (18)

1. Okamura K, Yamashina H (1979). A heuristic algorithm for the assembly line model-mix sequencing problem to minimize the risk of stopping the conveyor. Int J Prod Res 17: 233-247.
2. Yano CA, Bolat A (1989). Survey, development, and application of algorithms for sequencing paced assembly lines. J Man Opns Mgmt 2: 172-198.
3. Coffman PE Jr., Hoffman SE, Weiner SA (1985). An OR view of assembly plant modeling. Paper presented at the TIMS/ORSA Conference. Boston, MA.
4. Buzacott JA (1990). Abandoning the moving assembly line: models of human operators and job sequencing. Int J Prod Res 28: 821-839.
5. Yano CA, Rachamadugu R (1991). Sequencing to minimize work overload in assembly lines with product options. Mgmt Sci 37: 572-586.
6. Bolat A, Savsar M, Al-Fawzan MA (1994). Algorithms for real-time scheduling of jobs on mixed model assembly lines. Comput Opns Res 21: 487-498.
7. Bolat A (1994). Sequencing jobs on an automobile assembly line: objectives and procedures. Int J Prod Res 32: 1219-1236.
8. McCormick ST, Pinedo ML, Shenker S, Wolf B (1989). Sequencing in an assembly line with blocking to minimize cycle time. Opns Res 37: 925-935.
9. Ding FY, Cheng L (1993). A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems. Opns Res Lett 13: 27-36.
10. Murtagh BA, Saunders MA (1984). Minos 5.0, A Modular InCore Nonlinear Optimization System Version 5. System Optimization Laboratory, Stanford University.
11. Metropolis N et al (1953). Equation of state calculations by fast computing machines. J Chem Phys 21: 1087-1092.
12. Kirkpatrick S, Gelatt GD Jr., Vecchi MP (1983). Optimization by simulated annealing. Science 220: 671-680.
13. Aarts E, Korst J (1989). Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computer. Wiley: New York.
14. Collins NE, Eglese RW, Golden BI (1988). Simulated annealing an annotated bibliography. Am J Math Mgmt Sci 8: 209-307.
15. Dueck G, Schuer T (1990). Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comp Phys 90: 161-175.
16. Connolly DT (1990). An improved annealing scheme for the QAP. Eur J Opns Res 46: 93-100.
17. Lundy M, Mees A (1986). Convergence of an annealing algorithm. Math Program 34: 111-124.
18. Montgomery DC (1991). Design and Analysis of Experiment. Wiley: New York