Job shop scheduling with combinatorial priority rules in a furniture company
1 Department of Industrial and Systems Engineering, Faculty of Mechanical Engineering, Ho Chi Minh City University of Technology (HCMUT), 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam.
2 Vietnam National University Ho Chi Minh City, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam.
Review
World Journal of Advanced Engineering Technology and Sciences, 2023, 10(02), 213–222.
Article DOI: 10.30574/wjaets.2023.10.2.0312
Publication history:
Received on 10 November 2023; revised on 18 December 2023; accepted on 21 December 2023
Abstract:
This paper analyzed a job shop scheduling problem with combinatorial priority rule from a case study of a furniture company, whose product – cupboard – has the highest volume and revenue while it is struggling with tardiness at about 10%. The goal of this scheduling is to minimize the mean flow time, mean tardiness time and the proportion of tardy jobs and compare its performance to one traditional priority rule – Longest Processing Time first. As results, the combinatorial priority rules in scheduling would bring a positive outcome with reducing mean flow time and around 3.45% for proportion of tardy jobs. Moreover, the most significant improvement is true for mean tardiness time, which is reduced by over 3 times compared to Longest Processing Time first alternative. This combinatorial priority rule is recommended to schedule in flexibly ways according to the customer’s demand. It should be considered to use as the initial alternative for the improvement search algorithms to find out better solutions.
Keywords:
Shop Floor Scheduling; Combined Priority Rules; Job Shop; Furniture Manufacturing
Full text article in PDF:
Copyright information:
Copyright © 2023 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution Liscense 4.0