Job shop scheduling model for non-identic machine with fixed delivery time to minimize tardiness

2nd International Manufacturing Engineering Conference; 3rd Asia-Pacific Conference on Manufacturing Systems

Kusuma, K.K.^1 ; Maruf, A.^1

Faculty of Industrial Technology, Institut Teknologi Bandung, Bandung

40132, Indonesia^1

关键词: Branch-and-bound algorithms;    Delivery time;    Job shop environment;    Manufacture industry;    Production machines;    Programming models;    tardiness;    utility;   

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

来源: IOP

【 摘 要 】

Scheduling non-identic machines problem with low utilization characteristic and fixed delivery time are frequent in manufacture industry. This paper propose a mathematical model to minimize total tardiness for non-identic machines in job shop environment. This model will be categorized as an integer linier programming model and using branch and bound algorithm as the solver method. We will use fixed delivery time as main constraint and different processing time to process a job. The result of this proposed model shows that the utilization of production machines can be increase with minimal tardiness using fixed delivery time as constraint.