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

Péter Györgyi, T. Kis

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)220-225
Number of pages6
JournalComputers and Industrial Engineering
Volume115
DOIs
Publication statusPublished - Jan 1 2018

Fingerprint

Mathematical programming
Logistics
Raw materials
Scheduling

Keywords

  • Branch-and-cut
  • Integer programming
  • Non-renewable resources
  • Scheduling
  • Single machine

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut. / Györgyi, Péter; Kis, T.

In: Computers and Industrial Engineering, Vol. 115, 01.01.2018, p. 220-225.

Research output: Contribution to journalArticle

@article{c3faf08dc5c94cb3915e29cdd0f42326,
title = "Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut",
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.",
keywords = "Branch-and-cut, Integer programming, Non-renewable resources, Scheduling, Single machine",
author = "P{\'e}ter Gy{\"o}rgyi and T. Kis",
year = "2018",
month = "1",
day = "1",
doi = "10.1016/j.cie.2017.11.016",
language = "English",
volume = "115",
pages = "220--225",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",

}

TY - JOUR

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

AU - Györgyi, Péter

AU - Kis, T.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Branch-and-cut

KW - Integer programming

KW - Non-renewable resources

KW - Scheduling

KW - Single machine

UR - http://www.scopus.com/inward/record.url?scp=85034946780&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034946780&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2017.11.016

DO - 10.1016/j.cie.2017.11.016

M3 - Article

AN - SCOPUS:85034946780

VL - 115

SP - 220

EP - 225

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

ER -