bc-prod: a specialized branch-and-cut system for lot-sizing problems. bc-prod is a prototype modelling and optimization system designed and able to tackle a wide variety of the discrete-time lot-sizing problems arising both in practice and in the literature. To use bc-prod, the user needs to formulate his/her problem as a mixed integer program using XPRESS-MP’s mp-model, a standard mathematical programming modelling language, taking into account a reserved set of key words for specific lot-sizing objects, such as production variables, storage, and demand data, etc. The problem is then solved by the XPRESS-MP branch-and-bound system including lot-sizing specific preprocessing, cutting planes for different aspects of lot-sizing problems, plus general cutting planes, and a lot-sizing-specific primal heuristic. Results are presented for a wide variety of big bucket and small bucket models with set-up and start-up costs and times.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 28 articles )

Showing results 1 to 20 of 28.
Sorted by year (citations)

1 2 next

  1. Boland, Natashia; Clement, Riley; Waterer, Hamish: A bucket indexed formulation for nonpreemptive single machine scheduling problems (2016)
  2. de Araujo, Silvio Alexandre; de Reyck, Bert; Degraeve, Zeger; Fragkos, Ioannis; Jans, Raf: Period decompositions for the capacitated lot sizing problem with setup times (2015)
  3. Caserta, Marco; Voß, Stefan: A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (2013)
  4. Wu, Tao; Akartunalı, Kerem; Song, Jie; Shi, Leyuan: Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (2013)
  5. Akartunalı, Kerem; Miller, Andrew J.: A computational analysis of lower bounds for big bucket production planning problems (2012)
  6. Wu, Tao; Shi, Leyuan; Geunes, Joseph; Akartunalı, Kerem: On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times (2012)
  7. Wu, Tao; Shi, Leyuan; Song, Jie: An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times (2012)
  8. Zhang, Minjiao; Küçükyavuz, Simge; Yaman, Hande: A polyhedral study of multiechelon lot sizing with intermediate demands (2012)
  9. Guan, Yongpei: Stochastic lot-sizing with backlogging: computational complexity analysis (2011)
  10. Buschkühl, Lisbeth; Sahling, Florian; Helber, Stefan; Tempelmeier, Horst: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (2010)
  11. Narayanan, Arunachalam; Robinson, Powell: Efficient and effective heuristics for the coordinated capacitated lot-size problem (2010)
  12. Akartunalı, Kerem; Miller, Andrew J.: A heuristic approach for big bucket multi-level production planning problems (2009)
  13. Yaman, Hande: Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (2009)
  14. Absi, Nabil; Kedad-Sidhoum, Safia: The multi-item capacitated lot-sizing problem with setup times and shortage costs (2008)
  15. Aghezzaf, El-Houssaine; Najid, Najib M.: Integrated production planning and preventive maintenance in deteriorating production systems (2008)
  16. Guan, Yongpei; Miller, Andrew: A polynomial time algorithm for the stochastic uncapacitated lot-sizing problem with backlogging (2008)
  17. Quadt, Daniel; Kuhn, Heinrich: Capacitated lot-sizing with extensions: a review (2008)
  18. Yaman, Hande; Şen, Alper: Manufacturer’s mixed pallet design problem (2008)
  19. Absi, Nabil; Kedad-Sidhoum, Safia: MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs (2007)
  20. Jans, Raf; Degraeve, Zeger: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (2007)

1 2 next