Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut
  • Metaadatok
Tartalom: http://real.mtak.hu/63275/
Archívum: MTA Könyvtár
Gyűjtemény: Status = Submitted


Type = Article
Cím:
Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut
Létrehozó:
Györgyi, Péter
Kis, Tamás
Kiadó:
Elsevier
Dátum:
2017-06-28
Téma:
QA Mathematics / matematika
QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Tartalmi leírás:
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.
Nyelv:
magyar
Típus:
Article
NonPeerReviewed
info:eu-repo/semantics/article
Formátum:
text
Azonosító:
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)
Kapcsolat: