Knowledge-based factory scheduling: Resource allocation and constraint satisfaction

  • Liu B
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 4

    Citations

    Citations of this article.

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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Bing Liu

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free