Scheduling an assembly job shop production system with multiple objectives: a simulation study
02 Sep 2019-International Journal of Industrial and Systems Engineering (Inderscience Publishers)-Vol. 33, Iss: 1, pp 97-128
TL;DR: The analysis of results reveals that integrating dispatching rules with ORR policies provides better system performance than using dispatchingRules alone, and the proposed ORR policy namely, backward scheduling with interval release policy provides better results than other ORR polices.
Abstract: This paper presents the salient aspects of the performance analysis of two mechanisms for shop floor control namely, order review/release (ORR) and dispatching rules in an assembly job shop system in a multi-objective environment. A simulation model of an assembly job shop is developed for experimentation with eight dispatching rules and four ORR mechanisms from the literature. An ORR policy based on the concept of backward scheduling and interval release is developed and incorporated in the simulation model. Grey relational analysis is used for ranking the ORR policy-dispatching rule combinations. Multivariate and univariate hypotheses are developed. The results are analysed using ANOVA and MANOVA. The analysis of results reveals that integrating dispatching rules with ORR policies provides better system performance than using dispatching rules alone. The proposed ORR policy namely, backward scheduling with interval release policy provides better results than other ORR polices.
Citations
More filters
TL;DR: A case study for an assembly job shop encountered in a hydraulic components manufacturing industry confirms that other dispatching rules other than the existing rule gives better performance.
1 citations
References
More filters
TL;DR: In this article, the problem of scheduling a set of N final products on M machines in a job shop environment that involve both machining and assembly operations is addressed, and a mathematical model is developed in an effort to obtain optimal solutions.
Abstract: Scheduling is one of the most important issues in the planning and operation of production systems, but in medium to large shops, the generation of consistently good schedules has proven to be extremely difficult. The problem is that optimal scheduling solutions involve costly and impractical enumeration procedures. In the literature, most scheduling problems only address jobs with serial or sequential operations. Rarely do they consider jobs in which machining and assembly operations are simultaneously involved. This lack of attention to scheduling problems that involve both machining and assembly goes against what one would normally find in most job shops. In this paper, the problem of scheduling a set of N final products on M machines in a job shop environment that involve both machining and assembly operations is addressed. The objective pursued is the minimization of production flow time (makespan). A mathematical model is developed in an effort to obtain optimal solutions. Because this type of model...
48 citations