A decomposition approach for the General Lotsizing and Scheduling Problem for Parallel production Lines

This paper studies the scheduling problem of material handling by AGV in complex stochastic production lines. We establish the AGV distribution rule that each AGV is responsible for only one zone, thus reduce the muti-vehicle problem to single-vehicle problem. Its difficult to use exact model to solve the problem since the scheduling problem is related to the time issue. Most literature adopts heuristic or meta-heuristic methods. We build discrete model to solve the problem based on the special structure of our problem, adding constraints only when loading and unloading events happen. The computational results demonstrate that our model can effectively solve the AGV scheduling problem.

Download Full-text

A Hybrid IP/GA Approach to the Parallel Production Lines Scheduling Problem

Discrete Dynamics in Nature and Society ◽

10.1155/2016/5201937 ◽

2016 ◽

Vol 2016 ◽

pp. 1-11

Author(s):

Huizhi Ren ◽

Shenshen Sun

Keyword(s):

Linear Programming ◽

Integer Linear Programming ◽

Mixed Integer Linear Programming ◽

Time Window ◽

Valid Inequalities ◽

Mixed Integer ◽

Scheduling Problem ◽

Production Lines ◽

Solution Approach ◽

Cp Decomposition

A special parallel production lines scheduling problem is studied in this paper. Considering the time window and technical constraints, a mixed integer linear programming (MILP) model is formulated for the problem. A few valid inequalities are deduced and a hybrid mixed integer linear programming/constraint programming (MILP/CP) decomposition strategy is introduced. Based on them, a hybrid integer programming/genetic algorithm (IP/GA) approach is proposed to solve the problem. At last, the numerical experiments demonstrate that the proposed solution approach is effective and efficient.

Download Full-text

The Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem: Evaluating the Generalized Mathematical Model

Mathematical Problems in Engineering ◽

10.1155/2015/182781 ◽

2015 ◽

Vol 2015 ◽

pp. 1-18 ◽

Cited By ~ 7

Author(s):

Claudio F. M. Toledo ◽

Alf Kimms ◽

Paulo M. França ◽

Reinaldo Morabito

Keyword(s):

Mathematical Model ◽

Lot Sizing ◽

Raw Materials ◽

Soft Drink ◽

Scheduling Problem ◽

Production Lines ◽

Modeling Methodology ◽

Synchronization Problem ◽

Problem Instances ◽

Lot Sizing And Scheduling

This paper presents the synchronized and integrated two-level lot sizing and scheduling problem (SITLSP). This problem is found in beverage production, foundry, glass industry, and electrofused grains, where the production processes have usually two interdependent levels with sequence-dependent setups in each level. For instance, in the first level of soft drink production, raw materials are stored in tanks flowing to production lines in the second level. The amount and the time the raw materials and products have to be stored and produced should be determined. A synchronization problem occurs because the production in lines and the storage in tanks have to be compatible with each other throughout the time horizon. The SITLSP and its mathematical model are described in detail by this paper. The lack of similar models in the literature has led us to also propose a set of instances for the SITLSP, based on data provided by a soft drink company. Thus, a set of benchmark results for these problem instances are established using an exact method available in an optimization package. Moreover, results for two relaxations proved that the modeling methodology could be useful in real-world applications.

Download Full-text