Genetic algorithm for solving the lotsizing and scheduling problem with sequence dependent setup costs
The main purpose of this paper is to develop a hybrid genetic algorithm in order to determine the lot sizes and their production scheduling in a single machine manufacturing system for multi-item orders, the objective function minimizes the sum of holding costs, tardy costs and setup costs. The prob...
Saved in:
Published in | Ingenieria y Desarrollo Vol. 34; no. 1; pp. 64 - 87 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English Spanish |
Published |
01.01.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The main purpose of this paper is to develop a hybrid genetic algorithm in order to determine the lot sizes and their production scheduling in a single machine manufacturing system for multi-item orders, the objective function minimizes the sum of holding costs, tardy costs and setup costs. The problem considers a set of orders to be processed each one with its own due date. Each order must be delivered complete. In the scheduling are considered sequence dependent setup times. The proposed hybrid genetic algorithm has embedded a heuristic that is used to calculate its fitness function. The heuristic method presents a modification on the optimal timming algorithm in which are involved sequence dependent set up times. A design of experiments is developed in order to assess the algorithm performance, which is also tested using random-generated data and results are compared with those generated by an exact method. The results show that the algorithm achieves a good performance in both solution quality and time especially for large instances. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 0122-3461 2145-9371 |
DOI: | 10.14482/inde.34.1.7948 |