Kis, Tamás and Kovács, András (2012) A cutting plane approach for integrated planning and scheduling. COMPUTERS & OPERATIONS RESEARCH, 39 (2). pp. 320-327. ISSN 0305-0548 10.1016/j.cor.2011.04.006

Full text not available from this repository. (Request a copy)

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. © 2011 Elsevier Ltd.

Item Type:	ISI Article
Uncontrolled Keywords:	Problem solving, Project management, Production engineering, production control, Planning, Parallel programming, SCHEDULING PROBLEM, Planning problem, Planning horizons, Parallel machine, Mathematical program, Integrated production, Integrated planning, Hierarchical decompositions, Feasible schedule, Cutting-plane approach, Computational testing, Branch-and-cut algorithms, Production planning and scheduling, Parallel machine scheduling, MATHEMATICAL PROGRAMMING, Cutting planes
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Research Laboratory on Engineering & Management Intelligence
Depositing User:	EPrints Admin
Date Deposited:	12 Dec 2012 08:40
Last Modified:	05 Feb 2014 12:27
URI:	https://eprints.sztaki.hu/id/eprint/6673

Update Item