Production time minimization in a process and assembly job shop

Dion H.Cummings McKoy, Pius J. Egbelu

Research output: Contribution to conferencePaperpeer-review

Abstract

This paper addresses the problem of scheduling of a set of N jobs through M machines in a job shop environment that involves both machining and assembly operations. Each job is an assembly of component and subassembly parts. The problem is modeled as a mathematical program to obtain a minimum production time schedule. A heuristic algorithm is also developed for solving large size problems that may involve high computational time if an exact solution procedure is used.

Original languageEnglish (US)
Pages432-437
Number of pages6
StatePublished - Dec 1 1997
Externally publishedYes
EventProceedings of the 1997 6th Annual Industrial Engineering Research Conference, IERC - Miami Beach, FL, USA
Duration: May 17 1997May 18 1997

Other

OtherProceedings of the 1997 6th Annual Industrial Engineering Research Conference, IERC
CityMiami Beach, FL, USA
Period5/17/975/18/97

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Production time minimization in a process and assembly job shop'. Together they form a unique fingerprint.

Cite this