Scheduling Flexible Flow Shop in Labeling Companies to Minimize the Makespan  

作　　者：Chia-Nan Wang Hsien-Pin Hsu Hsin-Pin Fu Nguyen Ky Phuc Phan Van Thanh Nguyen 

机构地区：[1]Department of Industrial Engineering and Management,National Kaohsiung University of Science and Technology,Kaohsiung,80778,Taiwan [2]Department of Supply Chain Management,National Kaohsiung University of Science and Technology,Kaohsiung,80778,Taiwan [3]Department of Marketing and Distribution Management,National Kaohsiung University of Science and Technology,Kaohsiung,80778,Taiwan [4]Faculty of Industrial Engineering and Management,International University,Ho Chi Minh City,70000,Vietnam [5]Faculty of Commerce,Van Lang University,Ho Chi Minh City,723000,Vietnam

出　　处：《Computer Systems Science & Engineering》2022年第1期17-36,共20页计算机系统科学与工程（英文）

摘　　要：In the competitive global marketplace,production scheduling plays a vital role in planning in manufacturing.Scheduling deals directly with the time to output products quickly and with a low production cost.This research examines case study of a Radio-Frequency Identification labeling department at Avery Dennison.The main objective of the company is to have a method that allows for the sequencing and scheduling of a set of jobs so it can be completed on or before the customer’s due date to minimize the number of late orders.This study analyzes the flexible flow shop scheduling problem with a sequence dependent setup by modifying the processing time and setup time to minimize the makespan on multiple machines.Based on the defined mathematical model,this study includes an alternative approach and application of heuristic algorithm with the input being big data.Both optimization programs are used in this study and compared to determine which method can better solve the company’s problems.The proposed algorithm is able to improve machine utilization with large-scale problems.

关 键 词：SCHEDULING flexibleflowshop sequencedependentsetup JUST-IN-TIME 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]