Scheduling flexible flow shop in labeling companies to minimize the makespan with avery dennison Vietnam case study

Abstract

In competitive global marketplace, production scheduling plays a vital role in planning in manufacturing. The scheduling deals directly with the time to output products quick and with low production cost. This research discusses about case study of RFID labeling department in Avery Dennison. The method how can we sequence and schedule a set of jobs completing on or before the customer’s due date to minimize the number of late orders are the main objective of the company. This thesis analyzes flexible flow shop scheduling problem with sequence dependent setup by modifying processing time and setup time to minimize makespan on multiple machines. Based on mathematical model defined, this research includes alternative approach and application of Heuristic algorithm with the big input data. Both optimization programs are used in this thesis in order to provide the better method that can solve company’s problems effectively. It is observed that the proposed algorithm is able to improve machine utilization with large size problems. Keywords: Flexible Flow shop Sequence dependent setup Makespan Sched uling Just-in-time