Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition

@inproceedings{oban2010SingleFacilitySO,
  title={Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition},
  author={Elvin Çoban and John N. Hooker},
  booktitle={CPAIOR},
  year={2010}
}
We use logic-based Benders decomposition to minimize tardiness in single-facility scheduling problems with many jobs and long time horizons. Release dates and due dates are given. A mixed integer linear programming (MILP) based master problem allocates jobs to segments of the time horizon, and a constraint programming (CP) based subproblem schedules the jobs in each segment. 
BETA

Citations

Publications citing this paper.
SHOWING 1-8 OF 8 CITATIONS

Logic-based Benders decomposition to solve the permutation flowshop scheduling problem with time lags

  • 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)
  • 2013
VIEW 14 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Permutation flowshop problem with time lags scheduling by logic-based Benders decomposition

  • 2013 International Conference on Control, Decision and Information Technologies (CoDIT)
  • 2013
VIEW 14 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Similar Papers

Loading similar papers…