An integrated model of scheduling, batch delivery and supplier selection in a make- to-order manufacturing system

Article history: Received June 25, 2015 Received in revised format: October 12, 2015 Accepted December 15, 2015 Available online December 17 2015 This paper analyzes a supply chain, which consists of a manufacturer, a retailer and several suppliers in which the retailer orders jobs to the manufacturer and the suppliers provide the requiring parts. The manufacturer schedules and processes the orders and dispatches them to the retailer either individually or collectively in batches. The manufacturer incurs a penalty cost for each tardy job and a transportation cost for every delivered batch and therefore, searches for a schedule that yields minimum number of tardy jobs and batches. Moreover, the manufacturer tries to optimize its supplying cost through locating the suppliers that offer appropriate release times and costs for manufacturing parts. Since the release times of parts directly affect scheduling of orders, in this research, we develop an integrated mathematical model for the manufacturer that incorporates suppliers' selection issue into the scheduling and batching decisions. Furthermore, we present a heuristic algorithm (greedy algorithm) and also a local search to quickly determine the optimal or near-optimal solutions. The computational analysis shows the importance of the integrated model and also the superiority and effectiveness of the heuristic algorithms. Growing Science Ltd. All rights reserved. 6 © 201

[1]  Fardin Ahmadizar,et al.  Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs , 2015, Comput. Oper. Res..

[2]  Rui Zhang,et al.  Supply chain scheduling at the manufacturer to minimize inventory holding and delivery costs , 2014 .

[3]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[4]  Boris Detienne,et al.  A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints , 2014, Eur. J. Oper. Res..

[5]  Farshad Faezy Razi A supplier selection using a hybrid grey based hierarchical clustering and artificial bee colony , 2014 .

[6]  Amir Ebrahimzadeh Pilerood,et al.  Single-machine batch scheduling minimizing weighted flow times and delivery costs with job release times , 2012 .

[7]  Stéphane Dauzère-Pérès,et al.  Minimizing late jobs in the general one machine scheduling problem , 1995 .

[8]  Ayatollah Karamouzian,et al.  Evaluating strategic issues in supply chain scheduling using game theory , 2014 .

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

[10]  Zhi-Long Chen,et al.  Integrated Production and Outbound Distribution Scheduling: Review and Extensions , 2010, Oper. Res..

[11]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[12]  Mohammad Mahdavi Mazdeh,et al.  A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs , 2007, Eur. J. Oper. Res..

[13]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[14]  Mohammad Mahdavi Mazdeh,et al.  A Branch and Bound Algorithm to Minimize the Total Weighed Number of Tardy Jobs and Delivery Costs , 2013 .

[15]  Zhi-Long Chen,et al.  Machine scheduling with transportation considerations , 2001 .

[16]  George L. Vairaktarakis,et al.  Integrated Scheduling of Production and Distribution Operations , 2005, Manag. Sci..

[17]  Tadeusz Sawik,et al.  Scheduling in Supply Chains Using Mixed Integer Programming , 2011 .

[18]  T. C. Edwin Cheng,et al.  Two-agent single-machine scheduling to minimize the batch delivery cost , 2016, Comput. Ind. Eng..

[19]  T. C. Edwin Cheng,et al.  Batch delivery scheduling with batch delivery cost on a single machine , 2007, Eur. J. Oper. Res..

[20]  Mohammad Mahdavi Mazdeh,et al.  A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times , 2008, Comput. Oper. Res..

[21]  J. M. Moore An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[22]  T.C.E. Cheng,et al.  Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times , 2013 .

[23]  Chung-Lun Li Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries , 2015, Theor. Comput. Sci..

[24]  Muminu O. Adamu,et al.  A survey of single machine scheduling to minimize weighted number of tardy jobs , 2013 .

[25]  Payam Ghanbari,et al.  A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs , 2012 .

[26]  Morteza Parhizkari,et al.  A multiple criteria decision making technique for supplier selection and inventory management strategy: A case of multi-product and multi-supplier problem , 2013 .

[27]  Christian Alexander Ullrich,et al.  The Cost-Cutting Potential of Supply Chain Scheduling , 2013 .

[28]  T. C. Edwin Cheng,et al.  Single machine scheduling with batch deliveries , 1996 .

[29]  Guruprasad Pundoor,et al.  Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost , 2005 .

[30]  M. Mazdeha,et al.  A mathematical model for weighted tardy jobs scheduling problem with a batched delivery system , 2011 .

[31]  Neelam Tyagi,et al.  Single Machine Scheduling in a Batch Delivery System with Fixed Delivery Dates , 2013 .