Applying constraint satisfaction techniques to job shop scheduling

@article{Cheng1997ApplyingCS,
  title={Applying constraint satisfaction techniques to job shop scheduling},
  author={Cheng-Chung Cheng and Stephen F. Smith},
  journal={Annals OR},
  year={1997},
  volume={70},
  pages={327-357}
}
In this paper, we investigate the applicability of a constraint satisfaction problem solving (CSP) model, recently developed for deadline scheduling, to more commonly studied problems of schedule optimization. Our hypothesis is two-fold: (1) that CSP scheduling techniques provide a basis for developing high-performance approximate solution procedures in optimization contexts, and (2) that the representational assumptions underlying CSP models allow these procedures to naturally accommodate the… CONTINUE READING
Highly Cited
This paper has 81 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 53 extracted citations

Search Algorithm for the Constraint Satisfaction Problem of VRPTW

Electronics, Robotics and Automotive Mechanics Conference (CERMA 2007) • 2007
View 6 Excerpts
Highly Influenced

Beyond Contention : Extending Texture-& u cheduling Heuristics

Cheduling Heuristics
1999
View 5 Excerpts
Highly Influenced

A Constraint-posting Framework for Scheduling under Complex Constraints

- Chung Cheng, Stephen F. SmithThe
1995
View 4 Excerpts
Highly Influenced

81 Citations

051015'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 81 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 58 references

An algorithm for hoist scheduling problems

Y. Yih
International Journal of Productions Research, 32(3):501{516. 33 • 1994
View 20 Excerpts
Highly Influenced

Basic Scheduling Problems

View 5 Excerpts
Highly Influenced

The one machine problem with delayed precedence constraints and its use in job shop scheduling

E. Balas, J. K. Lenstra, A. Vazacopoulos
Technical report, Graduate School of Industrial Administration, Carnegie Mellon University, #MSRR-589(R). • 1993
View 10 Excerpts
Highly Influenced

An algorithm for solving the job-shop problem

J. Carlier, E. Pinson
Management Science, 35(2):164{176. • 1989
View 4 Excerpts
Highly Influenced

Temporal Constraint Networks

View 3 Excerpts
Highly Influenced

The shifting bottleneck procedure for job shop scheduling

J. Adams, E. Balas, D. Zawack
Management Science, 34(3):391 { 401. • 1988
View 10 Excerpts
Highly Influenced

Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

Operations Research • 1969
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…