CPAIOR ’ 03 Integrating Mixed Integer Programming and Local Search : A Case Study on Job-Shop Scheduling Problems

@inproceedings{Danna2003CPAIOR0,
  title={CPAIOR ’ 03 Integrating Mixed Integer Programming and Local Search : A Case Study on Job-Shop Scheduling Problems},
  author={Emilie Danna and Edward Rothberg and Claude Le Pape},
  year={2003}
}
Recent work on solving job-shop scheduling problems with earliness and tardiness costs has led to several hybrid algorithms that are more effective than any one method alone. In particular, these hybrid methods have been found to be more effective than pure mixed integer programming (MIP) approaches. This paper takes a fresh look at MIP formulations in light of several new MIP strategies for producing better feasible solutions. We find that a new MIP approach that is a hybrid method in spirit… CONTINUE READING

Citations

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

References

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

Two generic schemes for efficient and robust cooperative algorithms

  • Emilie Danna, Claude Le Pape
  • In Constraint and Integer Programming Combined,
  • 2003
1 Excerpt

A comparison of genetic algorithms for the dynamic job shop scheduling problem

  • M. Vasquez, L. D. Whitley
  • In Proceedings of the Genetic and Evolutionary…
  • 2000
3 Excerpts

Similar Papers

Loading similar papers…