Planning and Scheduling to Minimize Tardiness

@inproceedings{Hooker2005PlanningAS,
  title={Planning and Scheduling to Minimize Tardiness},
  author={John N. Hooker},
  booktitle={CP},
  year={2005}
}
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. We consider two objectives: minimizing the number of late tasks, and minimizing total tardiness. Our main theoretical contribution is a relaxation of the cumulative scheduling subproblem, which is critical to performance. We obtain… CONTINUE READING
Highly Cited
This paper has 52 citations. REVIEW CITATIONS
31 Citations
13 References
Similar Papers

Citations

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

52 Citations

051015'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

References

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

Grossmann , Logic - based MINLP algorithms for the optimal synthesis of process networks

  • M. Türkay, E. I.
  • Computer Science
  • 2001

Logic circuit verification by Benders decomposition

  • J. N. Hooker, Hong Yan
  • Principles and Practice of Constraint Programming…
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…