Optimal scheduling of two-component products on a single facility

Authors:
Wen-Hua Yang
Affiliations:
Department of Business Administration, Chao-Yang University of Technology, 168 Gifeng E. Rd., Wufeng, Taichung County, 413, Taiwan
Venue:
International Journal of Systems Science
Year:
2004

Citing 1
Cited 1

A pairwise interchange solution procedure for a scheduling problem with production of components at a single facility

Computers and Industrial Engineering

On bills of materials structure and optimum product-level smoothing of parts usage in JIT assembly systems

International Journal of Systems Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We apply group technology on a single-facility scheduling problem of products assembled from common and unique components. Our model assumes that common components are classified into multiple families, whose set-up times are sequence-independent but not identical. This extension from one type of common components to multiple types distinguishes this study from those in the literature. After identifying properties for dominant schedules, a branch-and-bound algorithm is constructed to determine a production schedule with the minimum total completion time of products. A series of simulation experiments are made with respect to the number of families and the number of products. The outcome may provide a foundation for future research on this topic.