A General Heuristic for Production Planning Problems

  title={A General Heuristic for Production Planning Problems},
  author={Yves Pochet and Mathieu Van Vyve},
  journal={INFORMS Journal on Computing},
We consider production planning problems with the restriction that all integer variables model setups. Since nding a feasible solution of such problems is in general NP-complete, the classical approaches have been the use of heuristics to nd good feasible solutions on the one hand, or Branch&Cut on the other hand. In the case of the former, a dual bound is not available, and there is no guarantee of solution quality. For the latter, the accent has been on improving the dual bound and only the… CONTINUE READING