Scheduling Flexible Flow Shop in Labeling Companies to Minimize the Makespan

Abstract

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.

Energy consumption optimization in a printing company

“…The applicability of the proposed model is illustrated through a case study of a company with 100 functional departments located in several office buildings in Poland. Wang et al (2022) analyzed the problem of flexible production scheduling in a flow shop environment, with sequence-dependent setup, and proposed a case study in a labeling company. The main objective was to develop a methodology to sequence and schedule a set of jobs in order to meet the delivery date for customers, minimizing the number of late orders.…”

Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times

“…For the algorithm, most of them propose intelligent algorithms to solve this problem [6-25, 27-29, 31, 33, 35]. Fewer focus on heuristics [26,28,[30][31][32]34]. ere is only one paper that focused on exact algorithm [36].…”