Mixed-Model Assembly Line Sequencing in a JIT environment
Course Credit?
NoPaid Position?
NoPreferred Majors
Computer ScienceFaculty
John MittenthalDescription
In this work, an assembly line producing multiple vehicle models is considered where the goal is to minimize the total amount of time that the line stops. While it is assumed that the assembly line is balanced on the average, at some stations models may require varying amounts of time. Line stoppages occur whenever a vehicle reaches such a station and requires more time than takt (or cycle) time of the line. In other words, the requirement is that all processing must be completed at each station – even if it means the line has to stop. The challenge is to determine a vehicle sequence that minimizes the amount of line stoppage for a set of vehicles to be scheduled. Theoretical results have been developed for various problem scenarios. Some experimentation has been designed and performed (in FORTRAN). Status: This research is in an intermediate to advanced state. Research tasks include: 1) updating the literature review, 2) updating the code to C++, 3) developing & implementing meta-heuristic solution procedures, and 4) generating updated computational results.
Special Directions
Please attach a CV highlighting demonstrated knowledge of programming
Special Skills
Required: Computer programming Preferred: Knowledge of C++ and Fortran