2nd International Manufacturing Engineering Conference; 3rd Asia-Pacific Conference on Manufacturing Systems | |
Flexible Job-Shop Scheduling with Dual-Resource Constraints to Minimize Tardiness Using Genetic Algorithm | |
Paksi, A.B.N.^1 ; Ma'Ruf, A.^1 | |
Department of Industrial Engineering, Faculty of Industrial Technology, Institut Teknologi Bandung, Bandung | |
40132, Indonesia^1 | |
关键词: Dual resource constrained; Flexible job-shop scheduling; Meta-heuristic approach; Objective functions; Production technology; Routing flexibility; Scheduling problem; Steady-state condition; | |
Others : https://iopscience.iop.org/article/10.1088/1757-899X/114/1/012060/pdf DOI : 10.1088/1757-899X/114/1/012060 |
|
来源: IOP | |
【 摘 要 】
In general, both machines and human resources are needed for processing a job on production floor. However, most classical scheduling problems have ignored the possible constraint caused by availability of workers and have considered only machines as a limited resource. In addition, along with production technology development, routing flexibility appears as a consequence of high product variety and medium demand for each product. Routing flexibility is caused by capability of machines that offers more than one machining process. This paper presents a method to address scheduling problem constrained by both machines and workers, considering routing flexibility. Scheduling in a Dual-Resource Constrained shop is categorized as NP-hard problem that needs long computational time. Meta-heuristic approach, based on Genetic Algorithm, is used due to its practical implementation in industry. Developed Genetic Algorithm uses indirect chromosome representative and procedure to transform chromosome into Gantt chart. Genetic operators, namely selection, elitism, crossover, and mutation are developed to search the best fitness value until steady state condition is achieved. A case study in a manufacturing SME is used to minimize tardiness as objective function. The algorithm has shown 25.6% reduction of tardiness, equal to 43.5 hours.
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
Flexible Job-Shop Scheduling with Dual-Resource Constraints to Minimize Tardiness Using Genetic Algorithm | 718KB | download |