Minimizing total weighted completion and batch delivery times with machine deterioration and learning effect: a case study from wax production

This paper investigates an integrated scheduling of production and distribution activities in the supply chain where both machine deterioration and learning effects have been consequently addressed. Manufacturer aims to minimize the total weighted completion time, while a distributor focuses on reducing shipping times with batch delivery by using capacitated vehicles. The aim of this problem is to minimize the sum of weighted completion times plus total delivery times. First, a mixed integer linear programming model is proposed. Then for a special case, a branch and bound algorithm is developed with utilizing the structural features of the problem. In order to solve large-scale instances of the general problem in a short/reasonable time, a simulated annealing algorithm is provided. Computational results show that the proposed heuristic techniques have high efficiency to achieve the optimal solution, and that they are useful to solve large sizes of the problems at a short time. Finally, by providing a real-life case of wax manufacturing and its distribution system, it is shown that the application of integrated decisions can significantly reduce costs imposed on the firms.

[1]  Rui Zhang,et al.  Single machine batch scheduling with release times and delivery costs , 2011, Journal of Scheduling.

[2]  Ji-Bo Wang,et al.  Learning effect and deteriorating jobs in the single machine scheduling problems , 2009 .

[3]  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..

[4]  Chin-Chia Wu,et al.  A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects , 2014, Inf. Sci..

[5]  Mohammad Rostami,et al.  Multi-objective parallel machine scheduling problem with job deterioration and learning effect under fuzzy environment , 2015, Comput. Ind. Eng..

[6]  MengChu Zhou,et al.  Single-Machine Scheduling With Job-Position-Dependent Learning and Time-Dependent Deterioration , 2012, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

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

[8]  Mohammad Rostami,et al.  A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs , 2014 .

[9]  Mohammad Rostami,et al.  Minimizing maximum tardiness and delivery costs with batch delivery and job release times , 2015 .

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

[11]  S. M. Seyedhoseini,et al.  Multi-level lot sizing and job shop scheduling with compressible process times: A cutting plane approach , 2013, Eur. J. Oper. Res..

[12]  Ji-Bo Wang,et al.  Single-machine group scheduling with both learning effects and deteriorating jobs , 2011, Comput. Ind. Eng..

[13]  Mohammad Rostami,et al.  Minimizing maximum tardiness and delivery costs in a batched delivery system , 2013, Comput. Ind. Eng..

[14]  Ji-Bo Wang,et al.  Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs , 2012, Int. J. Syst. Sci..

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

[16]  Ji-Bo Wang,et al.  Single-machine scheduling problems with the effects of learning and deterioration , 2007 .

[17]  Scott Kirkpatrick,et al.  Optimization by Simmulated Annealing , 1983, Sci..

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

[19]  Kamyar Sabri-Laghaie,et al.  Developing approximate algorithms for EPQ problem with process compressibility and random error in production/inspection , 2014 .

[20]  T.C.E. Cheng,et al.  Single-machine batch delivery scheduling with an assignable common due window , 2013 .

[21]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[22]  Mohammad Mahdavi Mazdeh,et al.  Single-machine batch scheduling minimizing weighted flow times and delivery costs , 2011 .

[23]  Cheng Wang,et al.  Single-machine due-window assignment problem with learning effect and deteriorating jobs , 2011 .

[24]  T. C. Edwin Cheng,et al.  Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan , 2007, Eur. J. Oper. Res..