Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/99321
Title: Knowledge-based factory scheduling: Resource allocation and constraint satisfaction
Authors: Liu, B. 
Issue Date: Jul-1993
Source: Liu, B. (1993-07). Knowledge-based factory scheduling: Resource allocation and constraint satisfaction. Expert Systems With Applications 6 (3) : 349-359. ScholarBank@NUS Repository.
Abstract: Scheduling is a difficult task. Much of the difficulty stems from the need to allocate the limited resources to attend to a large and diverse set of constraints. In this paper, the author highlights the conflict situations that occur between constraint satisfaction and resource availability and among constraints themselves. These conflict situations hamper the satisfaction of contraints. Through a detailed analysis of the scheduling process, it is suggested that the central problem in scheduling is how to predict the future impact of current decisions. In answer, two predictive techniques are proposed, reinforcement scheduling and a decomposition approach. Reinforcement scheduling advocates that before constructing a schedule some rough utilization plans (reinforcement plans) can be built as a basis for generating decision-making guidelines for detailed scheduling. The decomposition approach argues that it is ineffective to try to satisfy all the constraints in a single scheduling process. This method considers different constraints in different processes. Based on these ideas a scheduling system called RESS-II has been implemented. Test results have shown that these techniques are effective in performing their tasks. © 1993.
Source Title: Expert Systems With Applications
URI: http://scholarbank.nus.edu.sg/handle/10635/99321
ISSN: 09574174
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

26
checked on Feb 15, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.