Scheduling to minimize product design time using a genetic algorithm

International Journal of Production Research

Volumn 37, Issue 6, 1999, Pages 1369-1386

  Lam, F S C ^a   Lin, B C ^b   Sriskandarajah, C ^c,d   Yan, H ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b MOTOROLA INC   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

^d UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER SIMULATION; DECISION THEORY; GENETIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; SEMICONDUCTOR DEVICE MANUFACTURE;

COMBINATORIAL OPTIMIZATION METHODS;

PRODUCT DESIGN;

EID: 0032676409     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499191300     Document Type: Article

References (23)

1. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley).
2. Boctor, F. F., 1990, Some efficient multi-heuristic procedures for resource-constrained project scheduling. European Journal of Operational Research, 49, 3-13.
3. Carlier, J. and Latapie, B., 1990, An enumerative method for solving the resource constrained project scheduling problem. Proceedings of the Second International W orkshop on Project Management and Scheduling, Compiegne, France, June, pp. 122-129.
4. Chen, C-L., Vempati, V. S. and Aljaber, N., 1995, An application of genetic algorithms for flowshop problems. European Journal of Operational Research, 80, 389-396.
5. Christofides, N., Alvarez-Valdes, R. and Tamarit, J. M., 1987, Project scheduling with resource constraints: a branch and bound approach. European Journal of Operational Research, 29, 262-273.
6. Cohen, M. A., Eliashberg, J. and Ho, T. H., 1996, New product development: the performance and time-to-market trade off. Management Science, 42, 173-186.
7. Connolly, D. T., 1992, General purpose simulated annealing, Journal of the Operational Research Society, 43, 495-505.
8. Conway, R. W., Maxwell, W. L. and Miller, L. W., 1967, Theory of Scheduling (Reading, MA: Addison-Wesley).
9. Davis, E. W., 1973, Project scheduling under resource constraints: historical review and categorization of procedures. AIIE Transactions, 5, 297-313.
10. Davis, L. (ed.), 1991, Handbook of Genetic Algorithms (New York: van Nostrand Reinhold).
11. Garey, M. R. and Johnson, D. S., 1979, Computers and Intractability: a Guide to the Theory of NP-Completeness (New York: W. H. Freeman & Co.).
12. Glover, F., 1989, Tabu search-Part I. ORSA Journal on Computing, 1, 190-206
13. Glover, F., 1990, Tabu search-Part II. ORSA Journal on Computing, 2, 4-32.
14. Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization and Machine Learning (New York: Addison-Wesley).
15. Graham, R. L., Lawler, E. L., Lenstra, J. K. and Rinnooy Kan, A. H. G., 1979, Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
16. Herroelen, W. S., 1972, Resource constrained project scheduling: the state of the art. Operations Research Quarterly, 23, 261-275.
17. Holland, J. H., 1975, Adaptation in Natural and Artificial Systems (Ann Arbor, MI.: The University of Michigan Press).
18. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B., 1989, Sequencing and scheduling: algorithms and complexity. Report BS-R8909, Amsterdam: Center for Mathematics and Computer Science.
19. Murata, T. and Ishibuchi, H., 1994, Performance evaluation of genetic algorithms for flow-shop scheduling problems. Proceedings of the IEEE Conference on Genetic Algorithms, pp. 812-817.
20. Patterson, J. H., 1984, A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem. Management Science, 30, 854-867.
21. Patterson, J. H., Talbot, F. B., Slowinski, R. and Weglarz, J. 1990, Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problem. European Journal of Operational Research, 49, 68-79.
22. Pinedo, M., 1995, Scheduling: Theory, Algorithms and Systems (New York: Prentice Hall).
23. Slowinski, R. and Weglarz, J., 1989, Advances in Project Scheduling (Amsterdam: Elsevier).