A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line

Computers and Industrial Engineering

Volumn 30, Issue 4, 1996, Pages 969-981

  Sikora, Riyaz ^a  

^a UNIVERSITY OF MICHIGAN DEARBORN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; INTEGRATION; MANUFACTURE; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING;

FLOW LINE SCHEDULING; HEURISTIC ALGORITHM;

GENETIC ALGORITHMS;

EID: 0030241588     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/0360-8352(96)00046-0     Document Type: Article

References (23)

1. H. C. Bahl and L. P. Ritzman. A cyclical scheduling heuristic for lot sizing with capacity constraints. Int. J. Prod. Res. 22, 791-800 (1984).
2. H. C. Bahl, L. P. Ritzman and J. N. D. Gupta. Determining lot sizes and resource requirements: a review. Ops Res. 35, 329-345 (1987).
3. H. Singh and J. B. Foster. Production scheduling with sequence dependent setup costs. IIE Trans. 43-49 (1987).
4. D. M. Dilts and K. D. Ramsing. Joint lot sizing and scheduling of multiple items with sequence-dependent setup costs. Decision Sci. 20, 120-133 (1989).
5. V. L. Smith-Daniels and L. P. Ritzman. A model for lot sizing and sequencing in process industries. Int. J. Prod. Res. 26, 647-674 (1988).
6. O. A. Aras and L. A. Swanson. A lot sizing and sequencing algorithm for dynamic demands upon a single facility. J. Opns Mgmt 2, 177-185 (1982).
7. I. Lee, R. Sikora and M. Shaw. Joint lot sizing and sequencing with genetic algorithms for scheduling: evolving the chromosome structure. In Genetic Algorithms: Proc. of the Fifth Int. Conf. (GA93) (Edited by S. Forrest), pp. 383-389, Morgan Kaufmann, San Mateo, CA (1993).
8. I. Lee, R. Sikora and M. Shaw. A genetic algorithm based approach to flexible flow-line scheduling with variable lot sizes. IEEE Trans. Systems, Man, Cybernetics 27B(1) (1997).
9. R. Sikora, D. Chhajed and M. Shaw. Integrating the lot-sizing and sequencing decisions for scheduling a capacitated flow line. Computers Ind. Engng 30, 659-679 (1996).
10. J. H. Holland. Adaptations in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975).
11. S. Bagchi, S. Uckun, Y. Miyabe and K. Kawamura. Exploring problem-specific recombination operators for job shop scheduling. In Proc. of the Fourth Int. Conf. on Genetic Algorithms and Their Applications, pp. 10-17, San Diego, CA (1991).
12. G. A. Cleveland and S. F. Smith. Using genetic algorithm to schedule flow shop releases. In Proc. of the Third Int. Conf. on Genetic Algorithms and Their Applications, pp. 160-169, Arlington, VA (1989).
13. L. Davis. Job shop scheduling with genetic algorithm. In Proc. of the First Int. Conf. on Genetic Algorithms and Their Applications, pp. 136-140, Pittsburgh, PA (1985).
14. P. S. Gabbert, D. E. Brown, C. L. Huntley, B. P. Markowicz and D. E. Sappington. A system for learning routes and schedules with genetic algorithms. In Proc. of the Fourth Int. Conf. on Genetic Algorithms and Their Applications, pp. 430-436, San Diego, CA (1991).
15. R. Nakano and T. Yamada. Conventional genetic algorithm for job shop problems. In Proc. of the Fourth Int. Conf. on Genetic Algorithms and Their Applications, pp. 474-479, San Diego, CA (1991).
16. G. Syswerda and J. Palmucci. The application of genetic algorithms to resource scheduling. In Proc. of the Fourth Int. Conf. on Genetic Algorithms and Their Applications, pp. 502-508, San Diego, CA (1991).
17. D. Whitley, T. Starkweather and D'Ann Fuquay. Scheduling problems and traveling salesman. In Proc. of the Third Int. Conf. on Genetic Algorithms and Their Applications, pp. 133-140, Arlington, VA (1989).
18. D. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Co., Reading, MA (1989).
19. D. Goldberg and R. Lingle. Alleles, loci, and the travelling salesman problem. In Proc. of the 1st Int. Conf. on Genetic Algorithms and Their Applications, pp. 154-159, Pittsburgh, PA (1985).
20. I. M. Oliver. D. J. Smith and J. Holland. A study of permutation crossover operators on the travelling salesman problem. In Proc. of the 2nd Int. Conf. on Genetic Algorithms and Their Applications, pp. 224-230 (1987).
21. R. Peterson and E. A. Silver. Decision Systems for Inventory Management and Production Planning. Wiley, New York (1979).
22. D. S. Palmer. Sequencing jobs through a multistage process in the minimum total time - a quick method of obtaining a near optimum. Ops Res. Q. 16, 101-107 (1965).
23. K. Deb and D. E. Goldberg. An investigation of niche and species formation on genetic function optimization. Proc. of 3rd Int. Conf. on Genetic Algorithms, pp. 42-50, Fairfax, VA (1989).