Formulating and solving production planning problems

Formulating and solving production planning problems

0.00 Avg rating0 Votes
Article ID: iaor2000758
Country: Netherlands
Volume: 112
Issue: 1
Start Page Number: 54
End Page Number: 80
Publication Date: Jan 1999
Journal: European Journal of Operational Research
Authors: , ,
Keywords: optimization: simulated annealing
Abstract:

Production planning problems frequently involve the assignment of jobs or operations to machines. The simplest model of this problem is the well known assignment problem (AP). However, due to simplifying assumptions this model does not provide implementable solutions for many actual production planning problems. Extensions of the simple assignment model known as the generalized assignment problem and the multi-resource generalized assignment problem (MRGAP) have been developed to overcome this difficulty. This paper presents an extension of the MRGAP to allow splitting individual batches across multiple machines, while considering the effect of setup times and setup costs. The extension is important for many actual production planning problems, including ones in the injection molding industry and in the metal cutting industry. We formulate models which are logical extensions of previous models which ignored batch splitting for the problem we address. We then give different formulations and suggest adaptations of a genetic algorithm and simulated annealing. A systematic evaluation of these algorithms, as well as a Langrangian relaxation approach, is presented.

Reviews

Required fields are marked *. Your email address will not be published.