جستجوی مقالات مرتبط با کلیدواژه « reentrant permutation flow shop » در نشریات گروه « مدیریت »

Distributing the production activities among the supply chain facilities with regard to the considered criteria can have a significant impact on the productive management. In this paper, a comprehensive mathematical model for reentrant permutation flow shop scheduling via considering a preventive maintenance and distributed jobs on different facilities is proposed. The uncertainty of the time of preventive maintenance operation is handled using robust optimization technique based on the uncertainty budget approach. Job assignment to production facilities and job scheduling are determined in the proposed model by considering multiple objectives include Cmax minimization, production cost minimization, and average tardiness. Due to the NP-hard nature of the proposed flow shop scheduling problem, a new hybrid meta-heuristic based on the novel adaptive large neighborhood search and the simulated annealing is adopted. The obtained results from an extensive numerical experimentation indicate the efficiency of the proposed model and solution algorithm to tackle the proposed problem. In certain manufacturing industries, it has been observed that the classical assumption of flow shop scheduling, stating that each job visits each machine exactly once, is occasionally violated. The prime example can be noticed in the high-tech industries, i. e. semiconductor wafer fabrication in which the operation processes of the jobs are performed by re-visiting some workstations (Gupta & Sivakumar, 2006). The scheduling problem of this nature of processing is categorized as a distinct flow shop with reentrant line configuration, called reentrant flow shop scheduling (RFS) (Katragjini et. al. , 2015). The significance of RFS is the processing layers l. Each layer begins from the  first workstation and completes on the last workstation. It means that once a job finished a layer of a set of operations, it will repeat its process to the next layer starting on the first workstation until all operations are completed. The RFS scheduling has been an active research area and attracted a considerable attention since the past decade due to the development and improvement of high-tech industry. The complexity of RFS cannot be circumvented since it involves more operations than the classical flow shop. Moreover, the cyclic operations where the jobs with higher layers may overlap other jobs in the same work station are essential to be considered. As a result, these complexities have triggered the development of the efficient scheduling approaches to improve the system performance. Various researchers surveyed the scheduling techniques in semiconductor manufacturing and providing the global view on reentrant scheduling problems. Another form of RFS is reentrant permutation flow shop (RPFS) where at each level no passing is permitted, that is, not only the machine sequence the same for all jobs, but also the job sequence is the same for each machine (Rifai et al. , 2016).    Despite the enormous literature on the RFS, most studies -if not all- base their research on the assumption that the process only involves a single production line. Some studies exploredthe problem on hybrid RFS where the production stages have more than one machines available to process the jobs. Nevertheless, hybrid RFS is based on the single production line. Nowadays, single factory firms are less common, with multi-plant companies and supply chains taking a more important role in practice. Several literatures mentioned that multiple production lines with more than one production center, named as distributed manufacturing system, enables companies to achieve higher product quality, lower production costs and lower management risks. However, existing studies focused more on the economic field anddistributed finite capacity scheduling is seldom tackled. In this section, a novel hybrid meta-heuristic via considering the specific assumptions of the flow shop problem as a NP-hard problem is proposed. The proposed solution algorithm incorporates adaptive large neighborhood search and the simulated annealing algorithms. Various new construction and deconstruction neighborhood structures are applied in the proposed adaptive large neighborhood search algorithm. Details of the proposed algorithm is presented in Fig. 1. The results of the proposed solution algorithm assessment are presented based on the two common performance assessment criteria which are proposed in the literature after 10 times runs of the applied solution algorithms. These criteria are the average number of obtained Pareto solution at each iteration of  the algorithm and average number of Pareto solutions which are not dominated by solutions from  other compared algorithms. In addition, computational time is considered as a third criteria for performance assessment of the proposed solution algorithm (See Table 1). Obtained results indicate the superiority of the  proposed solution algorithm.   In this study, a comprehensive optimization model for an extended reentrant permutation flow shop scheduling via considering a preventive maintenance and distributed jobs on different facilities is proposed. To enhance the applicability of the proposed model, uncertainty of the time of preventive maintenance operation is handled using robust optimization technique based on the uncertainty budget approach. In the proposed mathematical model, multiple objectives include Cmax minimization, production cost minimization, and average tardiness are considered. The aim of the proposed model is to determine the job assignment to production facilities and job scheduling. A new hybrid meta-heuristic based on the novel adaptive large neighborhood search and the simulated annealing is applied as a consequence of the NP-hard nature of the proposed flow shop scheduling problem, . The obtained results from an extensive numerical experimentation indicate the efficiency of the proposed model and solution algorithm to tackle the proposed problem.