Job Scheduling for Hybrid Assembly Differentiation Flow Shop to Minimize Total Actual Flow Time considering Multi-Due-Dates

11th International Seminar on Industrial Engineering & Management, "Technology and Innovation Challenges Towards Industry 4.0 Era

工业技术（总论）

Maulidya, R.^1 ; Suprayogi^1 ; Wangsaputra, R.^1 ; Halim, A.H.^1

Industrial Engineering Faculty, Institut Teknologi Bandung, Bandung

40132, Indonesia^1

关键词: Algorithm for solving;    Due dates;    Finished products;    Flow-shops;    Flow-time;    Hybrid assembly;    Initial solution;    Job scheduling;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/528/1/012063/pdf
DOI  :  10.1088/1757-899X/528/1/012063

学科分类：工业工程学

来源: IOP

【 摘 要 】

The hybrid assembly differentiation flow shop is a three-stage flow shop system with machining, assembly and differentiation stages. The machining stage produces k parts in independently unrelated dedicated machines. After k parts of a job completed, they are assembled at the assembly stage and assigned to dedicated machines for a final process. At the end, several types of finished products are resulted. The finished products should be delivered at their respective different due dates. The problem is to find a schedule considering multi due dates, and the criterion of minimizing total actual flow time. This paper proposes a model for job scheduling in a hybrid assembly differentiation flow shops and its algorithm for solving the problems. The initial solution is defined using SPT-based heuristic and it is optimized using variable neighbourhood descend method. The proposed model is tested using a set of hypothetic data. The solution shows that the algorithm can solve the problems effectively.