A Study on the Job Shop Scheduling Using Improved Randomizing Algorithm

개선된 Randomizing 알고리즘을 이용한 Job Shop 일정계획에 관한 연구

  • Published : 2004.06.01

Abstract

The objective of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the job shop scheduling. The proposed heuristic method is based on a constraint satisfaction problem technique and a improved randomizing search algorithm. In this paper, ILOG programming libraries are used to embody the job shop model, and a constraint satisfaction problem technique is developed for this model to generate the initial solution. Then, a improved randomizing search algorithm is employed to overcome the increased search time of constrained satisfaction problem technique on the increased problem size and to find a improved solution. Computational experiments on well known MT and LA problem instances show that this approach yields better results than the other procedures.

Keywords

References

  1. Brailsford, S. C., C. N. Potts and B. M. Smith, 'constraint satisfaction problems: Algorithms and applications', European Journal of Operational Research, 119 (1999) : 557-581
  2. Dorndorf, U., Pesch, E. and T. Phan-Huy, 'Constraint propagation techniques for the disjunctive scheduling problem', Artifical Intelligence, 122 (2000) : 189-240
  3. ILOG, ILOG Solver manual, ILOG, (2002)
  4. ILOG, ILOG Scheduler manual, ILOG, (2002)
  5. Nuijten, W. and L. P. Claude, 'Constraint-Based Job Shop scheduling with ILOG Scheduler', Journal of Heuristic, 3 (1998) : 271-286
  6. Nuijten, W., L. P. Claude and P. Baptiste, 'constraint-based Optimization an Approximation for Job-Shop scheduling', Proceedings of the AAAI-SIGMAN Workshop on intelligent Manufacturing Systems, (1995)
  7. Walsh, T.,'Depth-bounded Discrepancy Search', APES Group, (1998)
  8. Wang, L. and D. Z. Zheng, 'An Effective hybrid optimization strategy ofr job-shop scheduling problems', Computers & Operations Research, 28 (2001) : 585 -596
  9. Weigel, R. and B. Faltings, 'Compiling constraint satisfaction problems', Artificial Intelligence, 115 (1999) : 257-287