preview

The Simple Assembly Line Balancing Problem

Better Essays

Review of
An improved mathematical program to solve the simple assembly line balancing problem

by
Rafael Pastor and Laia Ferrer

in
IOC Research Institute, Technical University of Catalonia,
Avenue Diagonal 647, (edif. ETSEIB), p. 11, 08028, Barcelona, Spain
(Received 20 July 2007; final version received 26 September 2007)

International Journal of Production Research
Vol. 47, No. 11, 1 June 2009, 2943–2959

Reviewed by Shiddarth Pitchai
IME 550- CRN 17747: Operations Research
Professor Ismet Esra Buyuktahtakin
December 3, 2014

Note: This paper for study purpose only.

Introduction
This paper is focused around planning and scheduling in production line, which propelled me to choose it. Simple Assembly Line Balancing Problem, a hypothetical model which is picking up prevalence, can be executed in large scale manufacturing as its point is to either to diminish the workstations (SALBP-1) or decrease the process duration (SALBP-2). Several papers have been published on this, the first one being formulated as 0-1 math program by Bowman and later modified to four 0-1 formulation by Patterson and Albracht(1975). First and foremost we have to discover a range of the workstations Ei and Li with a specific end goal to relegate the undertaking i to the earliest and most recent workstation, just like as any scientific model a preprocess is done.
Taking ti as process time; PTi as set of precede task; STi as set of succeed task, value of ct and an upper bound on

Get Access