Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems

Computers and Industrial Engineering

Volumn 53, Issue 2, 2007, Pages 313-320

  Jia, H Z ^a   Fuh, J Y H ^a   Nee, A Y C ^a   Zhang, Y F ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Gantt chart; Genetic algorithm; Production scheduling

Indexed keywords

GENETIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; PROCESS PLANNING; RESOURCE ALLOCATION; SCHEDULING;

GANTT CHART; PRODUCTION SCHEDULING; SCHEDULING PROBLEMS;

PRODUCTION CONTROL;

EID: 34548270446     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.06.024     Document Type: Article

References (13)

1. Dauzere-Peres S., and Paulli J. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research 70 (1997) 281-306
2. Fang, H. L., Ross, P., & Corne, D. (1993). A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems. In Proceedings of the fifth international conference on genetic algorithms (pp. 375-382). M. Kaufmann Publishers.
3. Gen M., and Cheng R. Genetic algorithms and engineering design (1997), John Wiley & Sons, Inc., New York
4. Hou E.S.H., Ansari N., and Ren H. A genetic algorithm for multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems 5 (1994) 113-120
5. Jia H.Z., Nee A.Y.C., Fuh J.Y.H., and Zhang Y.F. A modified genetic algorithm for distributed scheduling problems. Journal of Intelligent Manufacturing 14 (2003) 351-363
6. Mastrolilli M., and Gambardella L.M. Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling 3 (1998) 3-20
7. Park B.J., Choi H.R., and Kim H.S. A hybrid genetic algorithm for the job shop scheduling problems. Computers and Industrial Engineering 45 (2003) 597-613
8. Potts C., and Wassenhove L.V. A branch and bound algorithm for the total weighted tardiness problem. Operations Research 33 (1985) 363-377
9. Schrage L., and Baker K. Dynamic programming solution of sequencing problems with precedence constraints. Operations Research 26 (1978) 444-449
10. Srikanth K.I., and Barkha S. Improved genetic algorithm for the permutation flowshop scheduling problem. Computers and Operations Research 31 (2004) 593-606
11. Verma S., and Dessouky M. Single machine scheduling of unit time jobs with earliness and tardiness penalties. Mathematics of Operations Research 23 (2000) 930-943
12. Yano C., and Kim Y. Algorithms for single machine scheduling problems minimizing tardiness and earliness. European Journal of Operational Research 52 (1991) 167-178
13. Zalzala A.M.S., and Fleming P.J. Genetic algorithms in engineering systems (1997), The Institution of Electrical Engineers, London