摘要
This study introduces a bi-objective integrated supply chain (SC) scheduling (SCS) model to deal with the challenges of providing highly customized and on-time delivery requirements at the least cost. To address these real-life challenges, the model integrates the supply portfolio into production scheduling with a customer-imposed delivery time A set of conflicting factors is considered for the SC in which the manufacturer is modeled using the flexible job shop (FJS) problem to include greater flexibility in process routing. Since the proposed SCS model extends the strongly NP-hard FJS problem, two new meta-heuristic algorithms are developed, enhancing the performance of the multi-objective particle swarm optimization (MOPSO). A Tabu search inspired search mechanism and a problem-specific mutation operator are designed in both algorithms. As inadequate archive diversity leads to premature convergence and unsatisfactory Pareto solutions in many cases, this work employs two practical approaches separately (i.e., crowding distance (CD) and niche count preservation of reference point (RP)) in the proposed MOPSOs, called CD-MOPSO and RP-MOPSO, respectively. For leader selection, CD-MOPSO uses the swarm distance-based Roulette wheel, whereas the concept of RP is proposed in RP-MOPSO to expedite convergence. The performances of the proposed algorithms are validated against four existing algorithms and assessed by utilizing several criteria after solving 45 artificial instances. The simulation results and statistical analysis demonstrate the supremacy of the RP-MOPSO which increases the flexibility for a decision-maker in providing a higher number of Pareto solutions and more diverse and regular frontiers within reasonable computational time. Finally, a sensitivity analysis of the model is conducted, and managerial insights are provided.
学科与关键词
- Two meta-heuristic algorithms for optimizing a multi-objective supply chain scheduling problem in an identical parallel machines environmentFarmand, Nima*; Zarei, Hamid; Rasti-Barzoki, MortezaInternational Journal of Industrial Engineering Computations, 2021, 12(3): 249-272.被引 12
- MULTI-OBJECTIVE OPTIMIZATION OF INTEGRATED LOT-SIZING AND SCHEDULING PROBLEM IN FLEXIBLE JOB SHOPSRohaninejad, Mohammad*; Sahraeian, Rashed; Nouri, Behdin VahediRAIRO-OPERATIONS RESEARCH, 2016, 50(3): 587-609.被引 16
- Mathematical programming and three metaheuristic algorithms for a bi-objective supply chain scheduling problemZarei, Hamid; Rasti-Barzoki, Morteza*NEURAL COMPUTING & APPLICATIONS, 2019, 31(12): 9073-9093.被引 12
