REAL

Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut

Györgyi, Péter and Kis, Tamás (2017) Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut. Computers & Industrial Engineering. ISSN 0360-8352 (Submitted)

[img]
Preview
Text
lateness_full_orig.pdf

Download (314kB) | Preview

Abstract

Machine scheduling with raw material constraints has a great practical potential, as it is solved by ad-hoc methods in practice in several manufacturing and logistic environments. In this paper we propose an exact method for solving this problem with the maximum lateness objective based on mathematical programming, our main contribution being a set of new cutting planes that can be used to accelerate a MIP solver. We report on computational results on a wide set of instances.

Item Type: Article
Subjects: Q Science / természettudomány > QA Mathematics / matematika
Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User: Dr. Tamás Kis
Date Deposited: 21 Sep 2017 12:51
Last Modified: 21 Sep 2017 12:51
URI: http://real.mtak.hu/id/eprint/63275

Actions (login required)

Edit Item Edit Item