加班指派最適化研究 - 以半導體封裝廠為例

A Study of the Optimization of Overtime Assignment - A Case Study of Semiconductor Assembly Industry

莊美蘭(Mei-Lan Chuang)

指導教授 ： 饒忻

中原大學/電機資訊學院/工業與系統工程研究所/碩士(2019年)

https://doi.org/10.6840/cycu201900623

摘要

在全球競爭的浪潮下，企業生存越來越困難，其中人力成本與企業獲利更是息息相關。因此怎樣有效利用既有人力，能夠符合法規限制外又能達到成本最低的人力調度對企業來講就是提升競爭力的一種方法，因為成本降低就是增加獲利，獲利穩定就能讓企業永續經營。
本研究以半導體封裝廠加班費成本分析為探討主題，採用整數規劃求最佳解之特性，配合產線實際排班作業，在以符合法規為最高指導原則下，期許達到下列目標 :
(1) 符合法規 : 讓企業的運作不會因為人為排班疏失，造成違規情事。
(2) 成本最低 : 因應一例一休不同的出勤天數的加班倍率不盡相同，其排班結果必須符合成本最低之考量。
(3) 公平 : 產線運作容易有小團體，也可能因為排班人員個人喜好而影響排班結果，期許透過系統排班達到公平性。

關鍵字

勞動基準法 ； 人員指派 ； 整數規劃

並列摘要

Under the tide of global competition, enterprises are becoming more and more difficult to survive, and the cost of labor is closely related to the profitability of enterprises. Therefore, how to effectively use existing manpower, which can meet the regulatory limits and achieve the lowest cost, is a way to improve competitiveness for enterprises, because cost reduction is to increase profit, and profitability can make enterprises sustainable.
This study takes the over-the-counter labor cost analysis of the semiconductor assembly industry as the research topic, adopts linear programming as the theory, cooperates with the actual scheduling information of the production line, and meets the following guidelines with the highest guiding principle of compliance with regulations:
(1) Meet the regulations: Let the company not cause irregularities due to human scheduling, resulting in violations.
(2) The lowest cost: The overtime ratio of the different attendance days is different, and the result of the shift must meet the lowest cost consideration.
(3) Fairness: It is easy to have small groups in the operation of the production line. It will also affect the scheduling result due to the personal preference of the shifters. It is expected to achieve fairness through systematic scheduling.

並列關鍵字

Labor Standard Law ； Personnel Assignment ； Linear Programming

參考文獻

英文文獻

Beasley, J. E. and Cao, B. (1996). “A tree search algorithm for the crew scheduling problem”. European Journal of Operational Research,94(3), 517-526.

Burke, E. K., Li, J., and Qu, R. (2010). “A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems”. European Journal of Operational Research,203(2), 484-493.

Glass, C. A. and Knight, R. A. (2010). “The nurse rostering problem: A critical appraisal of the problem structure”. European Journal of Operational Research, 202(2), 379-389.

Kuhn, H. W. (1955). “The Hungarian method for the assignment problem”. 2(1‐2), 83-97.