Premium
Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem
Author(s) -
Colak Selcuk,
Agarwal Anurag
Publication year - 2005
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.20102
Subject(s) - heuristics , computer science , mathematical optimization , scheduling (production processes) , artificial neural network , heuristic , benchmark (surveying) , greedy algorithm , job shop scheduling , greedy randomized adaptive search procedure , artificial intelligence , mathematics , algorithm , routing (electronic design automation) , computer network , geodesy , geography
In this paper we propose some non‐greedy heuristics and develop an Augmented‐Neural‐Network (AugNN) formulation for solving the classical open‐shop scheduling problem (OSSP). AugNN is a neural network based meta‐heuristic approach that allows integration of domain‐specific knowledge. The OSSP is framed as a neural network with multiple layers of jobs and machines. Input, output and activation functions are designed to enforce the problem constraints and embed known heuristics to generate a good feasible solution fast. Suitable learning strategies are applied to obtain better neighborhood solutions iteratively. The new heuristics and the AugNN formulation are tested on several benchmark problem instances in the literature and on some new problem instances generated in this study. The results are very competitive with other meta‐heuristic approaches, both in terms of solution quality and computational times. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.