Two-stage algorithm for routing and scheduling flexible manufacturing cells

Richard A. Pitts, José A. Ventura

Research output: Contribution to conferencePaper

2 Citations (Scopus)

Abstract

Scheduling of resources and tasks has been, a key focus of manufacturing-related problems for many years. The research presented here focuses on production routing and scheduling of jobs within a flexible manufacturing cell. The major objective is to develop a two-stage heuristic methodology that minimizes the manufacturing makespan. For the routing phase (Stage I), a modified earliest completion time heuristic is utilized to construct initial feasible sequences. Then, during the sequencing phase (Stage II), a common heuristic is used to determine the makespan value. An illustrative example is given to show that the proposed heuristic methodology is effective in acquiring good solutions for small-to-medium size multi-machine FMC problems.

Original languageEnglish (US)
StatePublished - Dec 1 2006
Event2006 IIE Annual Conference and Exposition - Orlando, FL, United States
Duration: May 20 2006May 24 2006

Other

Other2006 IIE Annual Conference and Exposition
CountryUnited States
CityOrlando, FL
Period5/20/065/24/06

Fingerprint

Cellular manufacturing
Scheduling

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

Pitts, R. A., & Ventura, J. A. (2006). Two-stage algorithm for routing and scheduling flexible manufacturing cells. Paper presented at 2006 IIE Annual Conference and Exposition, Orlando, FL, United States.
Pitts, Richard A. ; Ventura, José A. / Two-stage algorithm for routing and scheduling flexible manufacturing cells. Paper presented at 2006 IIE Annual Conference and Exposition, Orlando, FL, United States.
@conference{557b954beddf4d1ca9656b357923170d,
title = "Two-stage algorithm for routing and scheduling flexible manufacturing cells",
abstract = "Scheduling of resources and tasks has been, a key focus of manufacturing-related problems for many years. The research presented here focuses on production routing and scheduling of jobs within a flexible manufacturing cell. The major objective is to develop a two-stage heuristic methodology that minimizes the manufacturing makespan. For the routing phase (Stage I), a modified earliest completion time heuristic is utilized to construct initial feasible sequences. Then, during the sequencing phase (Stage II), a common heuristic is used to determine the makespan value. An illustrative example is given to show that the proposed heuristic methodology is effective in acquiring good solutions for small-to-medium size multi-machine FMC problems.",
author = "Pitts, {Richard A.} and Ventura, {Jos{\'e} A.}",
year = "2006",
month = "12",
day = "1",
language = "English (US)",
note = "2006 IIE Annual Conference and Exposition ; Conference date: 20-05-2006 Through 24-05-2006",

}

Pitts, RA & Ventura, JA 2006, 'Two-stage algorithm for routing and scheduling flexible manufacturing cells', Paper presented at 2006 IIE Annual Conference and Exposition, Orlando, FL, United States, 5/20/06 - 5/24/06.

Two-stage algorithm for routing and scheduling flexible manufacturing cells. / Pitts, Richard A.; Ventura, José A.

2006. Paper presented at 2006 IIE Annual Conference and Exposition, Orlando, FL, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Two-stage algorithm for routing and scheduling flexible manufacturing cells

AU - Pitts, Richard A.

AU - Ventura, José A.

PY - 2006/12/1

Y1 - 2006/12/1

N2 - Scheduling of resources and tasks has been, a key focus of manufacturing-related problems for many years. The research presented here focuses on production routing and scheduling of jobs within a flexible manufacturing cell. The major objective is to develop a two-stage heuristic methodology that minimizes the manufacturing makespan. For the routing phase (Stage I), a modified earliest completion time heuristic is utilized to construct initial feasible sequences. Then, during the sequencing phase (Stage II), a common heuristic is used to determine the makespan value. An illustrative example is given to show that the proposed heuristic methodology is effective in acquiring good solutions for small-to-medium size multi-machine FMC problems.

AB - Scheduling of resources and tasks has been, a key focus of manufacturing-related problems for many years. The research presented here focuses on production routing and scheduling of jobs within a flexible manufacturing cell. The major objective is to develop a two-stage heuristic methodology that minimizes the manufacturing makespan. For the routing phase (Stage I), a modified earliest completion time heuristic is utilized to construct initial feasible sequences. Then, during the sequencing phase (Stage II), a common heuristic is used to determine the makespan value. An illustrative example is given to show that the proposed heuristic methodology is effective in acquiring good solutions for small-to-medium size multi-machine FMC problems.

UR - http://www.scopus.com/inward/record.url?scp=36448996657&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=36448996657&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:36448996657

ER -

Pitts RA, Ventura JA. Two-stage algorithm for routing and scheduling flexible manufacturing cells. 2006. Paper presented at 2006 IIE Annual Conference and Exposition, Orlando, FL, United States.