Two meta-heuristic algorithms for optimizing a multi-objective supply chain scheduling problem in an identical parallel machines environment
- 1 January 2021
- journal article
- research article
- Published by Growing Science in International Journal of Industrial Engineering Computations
- Vol. 12 (3), 249-272
- https://doi.org/10.5267/j.ijiec.2021.3.002
Abstract
Optimizing the trade-off between crucial decisions has been a prominent issue to help decision-makers for synchronizing the production scheduling and distribution planning in supply chain management. In this article, a bi-objective integrated scheduling problem of production and distribution is addressed in a production environment with identical parallel machines. Besides, two objective functions are considered as measures for customer satisfaction and reduction of the manufacturer’s costs. The first objective is considered aiming at minimizing the total weighted tardiness and total operation time. The second objective is considered aiming at minimizing the total cost of the company’s reputational damage due to the number of tardy orders, total earliness penalty, and total batch delivery costs. First, a mathematical programming model is developed for the problem. Then, two well-known meta-heuristic algorithms are designed to spot near-optimal solutions since the problem is strongly NP-hard. A multi-objective particle swarm optimization (MOPSO) is designed using a mutation function, followed by a non-dominated sorting genetic algorithm (NSGA-II) with a one-point crossover operator and a heuristic mutation operator. The experiments on MOPSO and NSGA-II are carried out on small, medium, and large scale problems. Moreover, the performance of the two algorithms is compared according to some comparing criteria. The computational results reveal that the NSGA-II performs highly better than the MOPSO algorithm in small scale problems. In the case of medium and large scale problems, the efficiency of the MOPSO algorithm was significantly improved. Nevertheless, the NSGA-II performs robustly in the most important criteria.Keywords
This publication has 40 references indexed in Scilit:
- Solving a new multi-objective hybrid flexible flowshop problem with limited waiting times and machine-sequence-dependent set-up time constraintsInternational Journal of Computer Integrated Manufacturing, 2013
- An ant colony optimization heuristic for an integrated production and distribution scheduling problemEngineering Optimization, 2013
- Integrated machine scheduling and vehicle routing with time windowsEuropean Journal of Operational Research, 2013
- Multi-objective analysis of an integrated supply chain scheduling problemInternational Journal of Production Research, 2012
- A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery systemComputers & Industrial Engineering, 2012
- Integrated Production and Outbound Distribution Scheduling: Review and ExtensionsOperations Research, 2010
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting propertyComputers & Operations Research, 2008
- Integrated Scheduling of Production and Distribution OperationsManagement Science, 2005
- Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobsInternational Journal of Production Economics, 2004
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the artComputer Methods in Applied Mechanics and Engineering, 2002