Abstract

Heuristic search is a core area of artificial intelligence and the employment of an efficient search algorithm is critical to the performance of an intelligent system. This paper addresses a production scheduling problem with complex precedence constraints in an identical parallel machines environment. Although this particular problem can be found in several production and other scheduling applications; it is considered to be mathcalNP-hard due to its high computational complexity. The solution approach we adopt is based on a comparison among several dispatching rules combined with a diagram analysis methodology. Computational results on large instances provide relatively high quality practical solutions in very short computational times, indicating the applicability of the methodology in real life production scheduling applications.

Keywords

Cite this article

@article{cai-1424,
  author  = {Katerina El Raheb and Christos T. Kiranoudis and Panagiotis P. Repoussis and Christos D. Tarantilis},
  title   = {Production Scheduling with Complex Precedence Constraints in Parallel Machines},
  journal = {Computing and Informatics},
  volume  = {24},
  number  = {3},
  pages   = {297--319},
  year    = {2005},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2005/3/production-scheduling-with-complex-precedence-constraints-in-parallel-machines/}
}
Download .bib