Skip to main content
SpringerLink
Log in

Solving the generalized job shop scheduling problem via temporal constraint propagation

  • AI Applications
  • Conference paper
  • First Online:
Knowledge Based Computer Systems (KBCS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 444))

Included in the following conference series:

Abstract

A Scheduling Algorithm with Temporal Constraint Propagation (STCP) is proposed to solve the generalized job shop scheduling problem. STCP propagates the precedence constraints and machine interference constraints to reduce the search space of the active schedules. Further, by making use of the temporal nature of the job shop scheduling, efficient algorithms to propagate precedence constraints and machine interference constraints are developed. Experimental results reveal that constraint propagation significantly reduces the computation time for scheduling. Further, the proposed temporal constraint propagation algorithms provide an order of magnitude improvement on the computation time over the conventional constraint propagation algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, J., Balas, E. and Zawack D., "The Shifting Bottleneck Procedure for Job Shop Scheduling", Management Science, Vol. 34, No. 3, March 1988, 391–401.

    Google Scholar 

  2. Carlier, J. and Pinson, E., "An Algorithm for Solving the Job Shop Problem", Management Science, Vol. 35, No. 2, February 1989, 164–176.

    Google Scholar 

  3. Garvey, M.R. and Johnson, D.S., "Computers and Intractability. A Guide to the Theory of NP-Completeness", W. H. Freeman and Co., 1979.

    Google Scholar 

  4. Giffler, B. and Thompson, G., "Algorithms for solving Production Scheduling Problems", Operations Research, 12, 1960, 305–324.

    Google Scholar 

  5. Mackworth, A.K. and Freuder, E.C., "The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems", Artificial Intelligence 25, 1985, 65–74.

    Google Scholar 

  6. Muth, J. and Thompson, G., eds., "Industrial Scheduling", Pretice-Hall, Englewood Cliffs, N.J., 1963, pp. 236.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of California, Los Angeles, 90024, Los Angeles, California, USA

    Wesley W. Chu & Patrick H. Ngai

Authors
  1. Wesley W. Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick H. Ngai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Ramani R. Chandrasekar K. S. R. Anjaneyulu

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chu, W.W., Ngai, P.H. (1990). Solving the generalized job shop scheduling problem via temporal constraint propagation. In: Ramani, S., Chandrasekar, R., Anjaneyulu, K.S.R. (eds) Knowledge Based Computer Systems. KBCS 1989. Lecture Notes in Computer Science, vol 444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018366

Download citation

  • DOI: https://doi.org/10.1007/BFb0018366

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52850-0

  • Online ISBN: 978-3-540-47168-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation