A cutting plane approach for integrated planning and scheduling

T. Kis, A. Kovács

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

In this paper we propose a branch-and-cut algorithm for solving an integrated production planning and scheduling problem in a parallel machine environment. The planning problem consists of assigning each job to a week over the planning horizon, whereas in the scheduling problem those jobs assigned to a given week have to be scheduled in a parallel machine environment such that all jobs are finished within the week. We solve this problem in two ways: (1) as a monolithic mathematical program and (2) using a hierarchical decomposition approach in which only the planning decisions are modeled explicitly, and the existence of a feasible schedule for each week is verified by using cutting planes. The two approaches are compared with extensive computational testing.

Original languageEnglish
Pages (from-to)320-327
Number of pages8
JournalComputers and Operations Research
Volume39
Issue number2
DOIs
Publication statusPublished - Feb 2012

Fingerprint

Planning and Scheduling
Cutting Planes
Scheduling
Planning
Parallel Machines
Scheduling Problem
Production/scheduling
Branch-and-cut
Production Planning
Horizon
Schedule
Decompose
Testing
Decomposition
Integrated
Planning and scheduling
Cutting planes
Parallel machines

Keywords

  • Cutting planes
  • Mathematical programming
  • Parallel machine scheduling
  • Production planning and scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Management Science and Operations Research
  • Modelling and Simulation

Cite this

A cutting plane approach for integrated planning and scheduling. / Kis, T.; Kovács, A.

In: Computers and Operations Research, Vol. 39, No. 2, 02.2012, p. 320-327.

Research output: Contribution to journalArticle

@article{a92259ab743447dba224da1528b07547,
title = "A cutting plane approach for integrated planning and scheduling",
abstract = "In this paper we propose a branch-and-cut algorithm for solving an integrated production planning and scheduling problem in a parallel machine environment. The planning problem consists of assigning each job to a week over the planning horizon, whereas in the scheduling problem those jobs assigned to a given week have to be scheduled in a parallel machine environment such that all jobs are finished within the week. We solve this problem in two ways: (1) as a monolithic mathematical program and (2) using a hierarchical decomposition approach in which only the planning decisions are modeled explicitly, and the existence of a feasible schedule for each week is verified by using cutting planes. The two approaches are compared with extensive computational testing.",
keywords = "Cutting planes, Mathematical programming, Parallel machine scheduling, Production planning and scheduling",
author = "T. Kis and A. Kov{\'a}cs",
year = "2012",
month = "2",
doi = "10.1016/j.cor.2011.04.006",
language = "English",
volume = "39",
pages = "320--327",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "2",

}

TY - JOUR

T1 - A cutting plane approach for integrated planning and scheduling

AU - Kis, T.

AU - Kovács, A.

PY - 2012/2

Y1 - 2012/2

N2 - In this paper we propose a branch-and-cut algorithm for solving an integrated production planning and scheduling problem in a parallel machine environment. The planning problem consists of assigning each job to a week over the planning horizon, whereas in the scheduling problem those jobs assigned to a given week have to be scheduled in a parallel machine environment such that all jobs are finished within the week. We solve this problem in two ways: (1) as a monolithic mathematical program and (2) using a hierarchical decomposition approach in which only the planning decisions are modeled explicitly, and the existence of a feasible schedule for each week is verified by using cutting planes. The two approaches are compared with extensive computational testing.

AB - In this paper we propose a branch-and-cut algorithm for solving an integrated production planning and scheduling problem in a parallel machine environment. The planning problem consists of assigning each job to a week over the planning horizon, whereas in the scheduling problem those jobs assigned to a given week have to be scheduled in a parallel machine environment such that all jobs are finished within the week. We solve this problem in two ways: (1) as a monolithic mathematical program and (2) using a hierarchical decomposition approach in which only the planning decisions are modeled explicitly, and the existence of a feasible schedule for each week is verified by using cutting planes. The two approaches are compared with extensive computational testing.

KW - Cutting planes

KW - Mathematical programming

KW - Parallel machine scheduling

KW - Production planning and scheduling

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

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

U2 - 10.1016/j.cor.2011.04.006

DO - 10.1016/j.cor.2011.04.006

M3 - Article

AN - SCOPUS:79958163663

VL - 39

SP - 320

EP - 327

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 2

ER -