Abstract

Resource scheduling, job sequencing, and assigning them to available resources are the most critical issues in manufacturing systems, such as flexible job-shop systems. In addition, scheduling uncertainties have attracted significant attention in this field. This study investigates the dual-resource constrained flexible job-shop scheduling (DRCFJSS) problem under machine breakdown and operational uncertainty. Stochastic scenario-based methods were utilized to study the uncertain nature of the problem. Because process times have inherent uncertainty, they are considered fuzzy numbers and are controlled by a credibility-based measure. Robust scheduling must be developed to address unexpected disruptions, such as machine breakdowns and operational risks, such as uncertain process times. Accordingly, a novel robust fuzzy stochastic programming (RFSP) model is presented to solve this problem. In the proposed RFSP model, the objective function is formulated using a hybrid measure (i.e., a combined average-case and worst-case performance of the manufacturing system) under probable machine breakdown scenarios. Because the DRCFJSS problem is NP-hard, two types of meta-heuristic algorithms, evolutionary population-based, genetic algorithm (GA), and vibration damping optimization (VDO) algorithm, are used for large-size problems. Then, the proposed RFSP model was applied to a case study, and numerical experiments with randomly generated test problems were used. In small-sized problems, the proposed model is solved using the CPLEX solver, GA, and VDO algorithms. Computational studies indicate a higher performance of the GA compared with the other algorithms in terms of the objective function.

Highlights

  • The job-shop scheduling (JSS) problem is widely used in real-world manufacturing systems

  • To explain the validation criteria, suppose that the dual-resource constrained flexible job-shop scheduling (DRCFJSS) problem is solved by the “M” approach, and zξM,pis obtained from the machine breakdown under scenario ξ ∈ Ξ and the specific realization of pfor the fuzzy parameters

  • In the case of machine breakdowns or operational uncertainties, much less disruption occurs in the system performance, and as a result, it remains close to the optimal value

Read more

Summary

INTRODUCTION

The job-shop scheduling (JSS) problem is widely used in real-world manufacturing systems. Zandieh and Adibi [16] addressed a dynamic JSS problem with random job arrivals and machine breakdowns, in which a hybrid performance measure of makespan and tardiness was considered. They introduced a VNS-based algorithm and applied an event-driven policy to deal with a dynamic nature. Lei [17] minimized the makespan for scheduling a stochastic JSS problem (subjected to a breakdown) He applied the proposed GA to some test problems and compared its performance with that of the SA and PSO algorithms.

Solution Methodology
DRCFJSS PROBLEM UNDER MACHINE BREAKDOWN AND UNCERTAINTY
PROPOSED RFSP MATHEMATICAL MODEL FOR
MODEL LINEARIZATION
COMPUTATIONAL STUDY
CONCLUSION AND FUTURE RESEARCHES
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call