A cutting plane approach for integrated planning and scheduling

Authors:
T. Kis;A. Kovács
Affiliations:
Computer and Automation Institute, Kende str. 13-17, H-1111 Budapest, Hungary;Computer and Automation Institute, Kende str. 13-17, H-1111 Budapest, Hungary
Venue:
Computers and Operations Research
Year:
2012

Citing 10
Cited 0

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
Lower bounds and reduction procedures for the bin packing problem

Discrete Applied Mathematics - Combinatorial Optimization
An integrated model for job-shop planning and scheduling

Management Science
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

INFORMS Journal on Computing
Detecting infeasibility and generating cuts for mixed integer programming using constraint programming

Computers and Operations Research
Manufacturing Planning and Control for Supply Chain Management

Manufacturing Planning and Control for Supply Chain Management
Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates

INFORMS Journal on Computing
Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound

Computers and Operations Research
A hybrid algorithm for a class of resource constrained scheduling problems

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.01

Visualization

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.