Mixed integer programming models for concurrent configuration design and scheduling in a reconfigurable manufacturing system

2020 ◽  
Vol 28 (1) ◽  
pp. 32-46 ◽  
Author(s):  
Jianping Dou ◽  
Chun Su ◽  
Xia Zhao

A reconfigurable manufacturing system can evolve its configuration to offer exactly the capacity and functionality needed for every demand period. For the reconfigurable manufacturing system with multi-part flow-line configuration simultaneously producing multiple parts within the same family, the production cost and the delivery time are closely related to its configuration and corresponding scheduling for certain demand period. Although studies on multi-part flow-line configuration design are abundant, studies on concurrent optimization of configuration design and scheduling for reconfigurable manufacturing system are scarce. First, a generic mixed integer nonlinear programming model for concurrent configuration design and scheduling is established to relax the limitation of the existing model, and then a mixed integer linear programming model is derived. The decisions of the two generalized models are to decide the amount of stations, the amount of identical machines and machines’ configuration for every station, and assign parts to machines along the multi-part flow line together with sequencing assigned parts for each machine. Based on the mixed integer linear programming model, an exact ε-constraint method is developed to obtain the Pareto optimal solutions with tradeoffs between cost and tardiness. The validation of two models and the ε-constraint method is verified against two cases adapted from the literature.

Author(s):  
Andrea Rossi ◽  
Michele Lanzetta

AbstractA flow line is a conventional manufacturing system where all jobs must be processed on all machines with the same operation sequence. Line buffers allow nonpermutation flowshop scheduling and job sequences to be changed on different machines. A mixed-integer linear programming model for nonpermutation flowshop scheduling and the buffer requirement along with manufacturing implication is proposed. Ant colony optimization based heuristic is evaluated against Taillard's (1993) well-known flowshop benchmark instances, with 20 to 500 jobs to be processed on 5 to 20 machines (stages). Computation experiments show that the proposed algorithm is incumbent to the state-of-the-art ant colony optimization for flowshop with higher job to machine ratios, using the makespan as the optimization criterion.


Sign in / Sign up

Export Citation Format

Share Document