Referências: |
Bibliografia
1. Claudio Arbib and Fabrizio Marinelli. Maximum lateness minimization in one-dimensional bin
packing. Omega 68 (2017) 7684.
2. Claudio Arbib and Fabrizio Marinelli. On cutting stock with due dates. Omega 46 (2014) 1120.
3. Claudio Arbib, P. Avella, M. Boccia, F. Marinelli, S. Mattia. Optimization Models for Cut
Sequencing. In: Sforza A., Sterle C. (eds) Optimization and Decision Science: Methodologies and
Applications. ODS 2017. Springer Proceedings in Mathematics & Statistics, vol 217
4. Kelly Cristina Poldi, Silvio Alexandre de Araujo. Mathematical models and a heuristic method for
the multiperiod one-dimensional cutting stock problem. Annals of Operations Research (2016) 238-
497.
5. Nuno Braga, Cláudio Alves, Rita Macedo and José Valério de Carvalho. A Model-Based
Heuristic for the Combined Cutting Stock and Scheduling Problem. In: Gervasi O. et al. (eds)
Computational Science and Its Applications -- ICCSA 2015. ICCSA 2015. Lecture Notes in Computer
Science, vol 9156.
6. Nuno Braga, Cláudio Alves, Rita Macedo and José Valério de Carvalho. Combined cutting stock
and scheduling: a matheuristic approach. Int. J. Innovative Computing and Applications 7(3) 2016, 135-
146.
7. Sergey Polyakovskiy, Alexander Makarowsky,Rym M'Hallah. Just-in-time batch scheduling
problem with two-dimensional bin packing constraints. In Proceedings of the 2017 Genetic and
Evolutionary Computation Conference (GECCO17), pages 321-328.
8. . Sergey Polyakovskiy, Rym MHallah. A Hybrid Feasibility Constraints-Guided Search to the TwoDimensional Bin Packing Problem with Due Dates. European Journal of Operational Research, Available
online 31 October 2017, https://doi.org/10.1016/j.ejor.2017.10.046
9. Artigos científicos sob o tema a serem apresentados pelos professores da disciplina. |