JIT Single Vehicle Scheduling in a Mixed-Model Assembly Line

Abstract:

Article Preview

This paper focus on single vehicle scheduling problem minimizing the line-side inventory of mixed-model assembly lines, considering the assembly sequence as an input.An exact algorithm is proposed based on three newly introduced concepts: conflicting, tight subset and complete conflicting subset, which divide the transportation operations into three classes.The solution generated by the algorithm is proved to be optimal. The algorithm is compared with the most popular FCFS (first-come, first-served) rule, and results shows the advantages of the algorithm, especially for large instances of the problem.

Info:

Periodical:

Advanced Materials Research (Volumes 211-212)

Edited by:

Ran Chen

Pages:

770-774

DOI:

10.4028/www.scientific.net/AMR.211-212.770

Citation:

Y. Q. Rao et al., "JIT Single Vehicle Scheduling in a Mixed-Model Assembly Line", Advanced Materials Research, Vols. 211-212, pp. 770-774, 2011

Online since:

February 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.