Optimal Scheduling, Coordination, and the Value of RFID Technology in Garment Manufacturing Supply Chains

Motivated by industrial practices, we explore in this paper the optimal supply chain scheduling problem in garment manufacturing with the consideration of coordination and radio frequency identification (RFID) technology. We consider the case in which a garment manufacturer receives orders from multiple retailers, and needs to determine the optimal order set to take and the corresponding optimal production schedule. We model the problem as a flowshop scheduling problem, uncover its structural properties, and prove that the problem is NP-hard in the ordinary sense only. We contribute by first developing a practical and effective pseudopolynomial dynamic programming algorithm to find the globally optimal solution in reasonable time; second, proposing an implementable method to achieve win–win supply chain coordination; and third, showing the good performance of RFID technology deployment. We further determine the critical threshold value of the order number with which the total manufacturing capacity must be increased if companies in the supply chain wish to improve their profits.

[1]  Avraham Shtub,et al.  Extending the Multimode Resource-Constrained Project Scheduling Problem by Including Value Considerations , 2016, IEEE Transactions on Engineering Management.

[2]  Tsan-Ming Choi,et al.  Scheduling and co-ordination of multi-suppliers single-warehouse-operator single-manufacturer supply chains with variable production rates and storage costs , 2013 .

[3]  Jatinder N. D. Gupta,et al.  A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES , 2000 .

[4]  Dvir Shabtay,et al.  Two-machine flow-shop scheduling with rejection , 2012, Comput. Oper. Res..

[5]  Chelliah Sriskandarajah,et al.  A review of TSP based approaches for flowshop scheduling , 2006, Eur. J. Oper. Res..

[6]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[7]  Suresh P. Sethi,et al.  Optimal Feedback Production Planning in a Stochastic N-Machine Flowshop , 1993 .

[8]  Xiangtao Li,et al.  Multiobjective Discrete Artificial Bee Colony Algorithm for Multiobjective Permutation Flow Shop Scheduling Problem With Sequence Dependent Setup Times , 2017, IEEE Transactions on Engineering Management.

[9]  T. C. Edwin Cheng,et al.  Optimal Scheduling of a Single-Supplier Single-Manufacturer Supply Chain With Common due Windows , 2010, IEEE Transactions on Automatic Control.

[10]  T.C.E. Cheng,et al.  Order acceptance and scheduling in a two-machine flowshop , 2013 .

[11]  Siu Keung Kwok,et al.  RFID-based intra-supply chain in textile industry , 2009, Ind. Manag. Data Syst..

[12]  Daniel Oron,et al.  Batch scheduling on a two‐machine jobshop with machine‐dependent setup times , 2011 .

[13]  Haitao Li,et al.  Stochastic Single-Machine Scheduling With Learning Effect , 2017, IEEE Transactions on Engineering Management.

[14]  Xian Zhou,et al.  Optimal Policies for Perishable Products When Transportation to Export Market Is Disrupted , 2014 .

[15]  Xiangtao Li,et al.  Multiobjective Local Search Algorithm-Based Decomposition for Multiobjective Permutation Flow Shop Scheduling Problem , 2015, IEEE Transactions on Engineering Management.

[16]  C. Sriskandarajah,et al.  Lot streaming and scheduling multiple products in two-machine no-wait flowshops , 1998 .

[17]  Mohsen Varmazyar,et al.  Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem , 2015, Ann. Oper. Res..

[18]  George T. S. Ho,et al.  A RFID-based Resource Allocation System for garment manufacturing , 2013, Expert Syst. Appl..

[19]  T. C. Edwin Cheng,et al.  Single Supplier Scheduling for Multiple Deliveries , 2001, Ann. Oper. Res..

[20]  Tsan-Ming Choi,et al.  Supply chain scheduling and coordination with dual delivery modes and inventory storage cost , 2011 .

[21]  Chris N. Potts,et al.  Supply chain scheduling: Batching and delivery , 2003, Oper. Res..

[22]  Jatinder N. D. Gupta,et al.  Minimizing tardy jobs in a flowshop with common due date , 2000, Eur. J. Oper. Res..

[23]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Jianming Yao,et al.  Scheduling Optimization in the Mass Customization of Global Producer Services , 2015, IEEE Transactions on Engineering Management.

[26]  Milind Dawande,et al.  Supply Chain Scheduling: Distribution Systems , 2006 .

[27]  Wieslaw Kubiak,et al.  Scheduling shops to minimize the weighted number of late jobs , 1994, Oper. Res. Lett..

[28]  Fariborz Jolai,et al.  A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection , 2009 .

[29]  C. T. Ng,et al.  Optimal algorithms for single-machine scheduling with rejection to minimize the makespan , 2011 .

[30]  Rafael Diaz,et al.  An Evaluation of the NERJIT Priority Rule in a Kanban‐Controlled Flowshop , 2012 .

[31]  King Lun Choy,et al.  A RFID-based recursive process mining system for quality assurance in the garment industry , 2014 .

[32]  Christos Koulamas,et al.  Review of the ordered and proportionate flow shop scheduling research , 2013 .

[33]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[34]  Gérard P. Cachon.  Supply Chain Coordination with Contracts , 2003, Supply Chain Management.

[35]  H. M. Soroush,et al.  Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem , 2007, Eur. J. Oper. Res..