Mixed integer linear programming approach for solving assembly scheduling problems

Ganesan, Sharathram

Permalink

https://hdl.handle.net/2142/99279 Copy

Description

Title

Mixed integer linear programming approach for solving assembly scheduling problems

Author(s)

Ganesan, Sharathram

Issue Date

2017-09-01

Director of Research (if dissertation) or Advisor (if thesis)

Nagi, Rakesh

Department of Study

Industrial&Enterprise Sys Eng

Discipline

Industrial Engineering

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

M.S.

Degree Level

Thesis

Keyword(s)

• Scheduling
• Mixed Integer Linear Program (MILP)
• CPLEX
• Batch overlapping

Abstract

In this research, the problem of scheduling operations in manufacturing facilities with multiple machines that produce complex multi-level assemblies is considered. The problem is modeled with precedence relationships between operations. It has been formulated as a Mixed Integer Linear Program and is modeled as a flow-like problem. The objective of the problem is to reduce the total makespan (cumulative lead time) of production of final product. In addition to that, move sizes and batch sizes of operations are taken into consideration to see their impact on total makespan. Predetermined move size is used which facilitates batch overlapping, which in turn helps reduce the makespan. Column generation method has been used to solve the problem. Subproblem generates solution sets and the master problem selects from the set of generated solutions by the subproblem. Randomly generated problems with up to 100 assembly operations, 100 batch size, and 20 workcenters are used to test the formulations. Results show that makespan increases with increase in move size. This shows that batch overlapping increases the effectiveness of a schedule.

Graduation Semester

2017-12

Type of Resource

text

Permalink

http://hdl.handle.net/2142/99279

Copyright and License Information

Copyright 2017 Sharathram Ganesan

Owning Collections