Copyright © 1988 Published by Elsevier Science Ltd.
Scheduling via reinforcement
Available online 1 April 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Scheduling of a job shop in the presence of limited resources is a challenging decision making process. It is a problem of allocation of different resources to meet various shop needs (or to satisfy the constraints). Past research has had only limited success in properly handling this resource problem. In this paper a detailed analysis of the scheduling process, within an AI framework, is proposed and this highlights the deficiencies in current techniques. It is suggested that the central problem is how to have a global perspective in the scheduling process. In order to deal with the underlying problem, the concept of ‘reinforcement planning’ is proposed. This method builds a reinforcement schedule and uses it to refine out a detailed schedule by inter-level analysis and communication. Based on this idea a scheduling system called RESS-I has been implemented to automatically construct the job shop schedule.
Author Keywords: planning; scheduling; resource allocation; constraint satisfaction







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)




