Constraint-Based Optimization and Approximation for Job-Shop Scheduling

@inproceedings{Baptiste1995ConstraintBasedOA,
  title={Constraint-Based Optimization and Approximation for Job-Shop Scheduling},
  author={P. Baptiste and Wim Nuijten},
  year={1995}
}
We present constraint-based optimization algorithms and a constraintbased approximation algorithm for the job-shop scheduling problem. An empirical performance analysis shows that both the optimization algorithms and the approximation algorithm perform well. Especially the approximation algorithm is among the best algorithms known to date. We, furthermore, show that we can improve the performance of the optimization algorithms by combining them with the approximation algorithm. In particular… CONTINUE READING
Highly Cited
This paper has 68 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

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

68 Citations

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

See our FAQ for additional information.

References

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

Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach, Ph.D

  • W.P.M. Nuijten
  • 1994
Highly Influential
6 Excerpts

A survey of priority rule-based scheduling

  • R. Haupt
  • OR Spektrum
  • 1989
Highly Influential
5 Excerpts

Evolution Based Learning in a Job Shop Environment, Working document, University of Limburg, the Netherlands

  • U. Dorndorf, E. Pesch
  • 1992

Similar Papers

Loading similar papers…