[vc_empty_space][vc_empty_space]
Job Scheduling for Hybrid Assembly Differentiation Flow Shop to Minimize Total Actual Flow Time considering Multi-Due-Dates
Maulidya R.a, Suprayogia, Wangsaputra R.a, Halim A.H.a
a Industrial Engineering Faculty, Institut Teknologi Bandung, Bandung, 40132, Indonesia
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© Published under licence by IOP Publishing Ltd.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.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Algorithm for solving,Due dates,Finished products,Flow-shops,Flow-time,Hybrid assembly,Initial solution,Job scheduling[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]hybrid assembly differentiation flow shop,job scheduling,multi due dates,total actual flow time[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text]This research was fully funded by Doctoral Dissertation Research Funding from Directorate General Higher Education Indonesia (2018), Ministry of Research, Technology and Higher Education under contract No.011/KM/PNT/2018 with Universitas Trisakti.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1088/1757-899X/528/1/012063[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]