Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Simple assembly line balancing problem of Type 1 with grey demand and grey task durations

Simple assembly line balancing problem of Type 1 with grey demand and grey task durations The purpose of this paper is to present a mixed integer programming model for simple assembly line balancing problems (SALBP) with Type 1 when the annual demand and task durations are uncertain and encoded with grey numbers.Design/methodology/approachGrey theory and grey numbers are used for illustrating the uncertainty of parameters in an SALBP, where the objective is to minimize the total number of workstations. The paper proposes a 0-1 mathematical model for SALBP of Type 1 with grey demand and grey task durations.FindingsThe uncertainty of the demand and task durations are encoded with grey numbers and a well-known 0-1 mathematical model for SALBP of Type 1 is modified to find the minimum number of workstations in order to meet both the lower and upper bounds of the uncertain demand. The results obtained from the proposed mathematical model show a task-workstation assignment that does not distribute precedence relations among tasks and workstations and the sum of task durations in each single workstation is less than or equal to the grey cycle time.Originality/valueThe grey theory and grey numbers have not been previously used to identify uncertainties in assembly line balancing problems. Therefore, this study provides an important contribution to the literature. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Grey Systems: Theory and Application Emerald Publishing

Simple assembly line balancing problem of Type 1 with grey demand and grey task durations

Loading next page...
 
/lp/emerald-publishing/simple-assembly-line-balancing-problem-of-type-1-with-grey-demand-and-XAzztqa51b
Publisher
Emerald Publishing
Copyright
© Emerald Publishing Limited
ISSN
2043-9377
DOI
10.1108/gs-05-2019-0011
Publisher site
See Article on Publisher Site

Abstract

The purpose of this paper is to present a mixed integer programming model for simple assembly line balancing problems (SALBP) with Type 1 when the annual demand and task durations are uncertain and encoded with grey numbers.Design/methodology/approachGrey theory and grey numbers are used for illustrating the uncertainty of parameters in an SALBP, where the objective is to minimize the total number of workstations. The paper proposes a 0-1 mathematical model for SALBP of Type 1 with grey demand and grey task durations.FindingsThe uncertainty of the demand and task durations are encoded with grey numbers and a well-known 0-1 mathematical model for SALBP of Type 1 is modified to find the minimum number of workstations in order to meet both the lower and upper bounds of the uncertain demand. The results obtained from the proposed mathematical model show a task-workstation assignment that does not distribute precedence relations among tasks and workstations and the sum of task durations in each single workstation is less than or equal to the grey cycle time.Originality/valueThe grey theory and grey numbers have not been previously used to identify uncertainties in assembly line balancing problems. Therefore, this study provides an important contribution to the literature.

Journal

Grey Systems: Theory and ApplicationEmerald Publishing

Published: Sep 30, 2019

Keywords: Grey system theory; Assembly line balancing; Integer programming; Grey numbers; Simple assembly line balancing problem of Type 1

References