APLIKASI BINARY INTEGER PROGRAMMING PADA PENYELESAIAN MASALAH LINE BALANCING

Gogor Arif Handiwibowo, Abdullah Shahab

Abstract


The proper assignment of work activities in a number of  workstations in a production line system influences heavily the success of the production process. This problem is hitherto solved by trial and error or using the heuristic method which naturally does not ensure an optimal solution. The method of Binary Integer Programming is here proposed to solve this problem, which will ultimately guarantee an optimal solution. Optimization is carried
out by formulating mathematical model programming with an objective function compelled to achieve the minimum number of workstations. This optimization is performed under the constraints of interdependency between work activities, cycle time, activities time, demand, and productive time available. The model is then employed in the production of women slipper. Optimization carried out by suitable software is proven able to assign each
work activity in a specific workstation with an optimal efficiency. Comparison with the current performance shows a substantial efficiency increase.

Keywords


Optimization, Binary Integer Programming, Line Balancing, Time Study

Full Text:

PDF

References


Besterfield, Dale H., 2000. Quality Control, Prentice Hall International, USA.

Chase, R B., Jacobs, F R dan Aquilano, N J.,1998. Operation Management for Competitive Advantage, McGraw-Hill, New York.

Taha, Hamdy A., 1997. Operation Research an Introduction, Prentice Hall International, USA.

Tailor, Bernard W., 1999. Introduction to Management Science, Prentice Hall International, USA




DOI: http://dx.doi.org/10.12962/j24609463.v2i1.2812

Refbacks

  • There are currently no refbacks.


Creative Commons License
Jurnal Teknobisnis by LPPM ITS is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Based on a work at http://iptek.its.ac.id/index.php/tekno/index.

 

Flag Counter