A heuristic algorithm for minimizing Makespan in a flexible manufacturing environment

Richard A. Pitts, José A. Ventura

Research output: Contribution to conferencePaperpeer-review

2 Scopus citations

Abstract

Scheduling of manufacturing-based resources and tasks has been a critical issue in the manufacturing industry for many years. This research focuses on production routing and sequencing of jobs within a flexible manufacturing cell (FMC). A two-stage algorithm that minimizes the manufacturing makespan (MS) is presented. During Stage I (construction phase), two heuristics are utilized to generate an initial feasible sequence and an initial MS solution. In Stage II (improvement phase), the acquired initial solutions from Stage I are combined with a Tabu Search meta-heuristic procedure that provides improved MS solutions. Test cases show that the two-stage algorithm provides a tremendous savings in computational time for medium/large sized multi-machine FMC problems.

Original languageEnglish (US)
Pages1196-1201
Number of pages6
StatePublished - 2007
EventIIE Annual Conference and Expo 2007 - Industrial Engineering's Critical Role in a Flat World - Nashville, TN, United States
Duration: May 19 2007May 23 2007

Other

OtherIIE Annual Conference and Expo 2007 - Industrial Engineering's Critical Role in a Flat World
Country/TerritoryUnited States
CityNashville, TN
Period5/19/075/23/07

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this