مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

342
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

161
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

branch and bound algorithm equipped with tighter lower bound values for makespan minimization on a batch processing machine

Pages

  00-00

Abstract

 In this paper, the problem of scheduling jobs with non-identical sizes has been studied on a single-batch processing machine, in order to minimize the makespan. Using new lower bounds, a branch and bound algorithm has been proposed to solve the problem. In this algorithm, two new methods have been used to generate lower bounds and results have been compared with the existing lower bound in literature. In order to evaluate the performance of the proposed method, test problems have been randomly generated and branch and bound algorithm has been tested with different lower bounds on these cases. Findings indicated that when the size of the jobs is large compared to the capacity of the machine, the branch and bound algorithm with the new lower bound has the best performance. When the size of the jobs is small compared to the capacity of the machine (up to half the capacity of the machine), the algorithm with existing lower bound has better performance. In addition, when the size of the jobs is neither large nor small, the lower bounds provide the best performance. Introduction: Based on predictions, services are a key component of the growth of the global economy in future (Arnold et al. 2011). Acording to Jane and Kumar (2012), services play a critical role in a supply chain. Also, according to Wang et al. (2015), a "product" or "service" must exist in each supply chain which is produced by the upstream sectors and delivered to downstream. Recently due to increasing customer expectations, companies’ competition has been replaced by the supply chains competition and as a result, competition has been increased in the simultaneous supply of products and services. This has led to challenges in integrating companies and in coordinating the materials, information and financial flow that were previously overlooked. Accordingly, a new managerial philosophy has been developed known as Product-service supply chain (PSSC) (Stanley & Wisner, 2002). This study seeks to develop a Performance evaluation model for the Product-service supply chain in the Home appliance industry, which is finally solved using Adaptive Neuro-Fuzzy Inference System (ANFIS). Design/Approach: In this paper, Performance evaluation constructs and criteria of service supply chain are identified by reviewing the literature and exploratory and confirmatory Factor analysis and then, the Performance evaluation of service supply chains in Iran's Home appliance industry has been performed using these constructs, criteria and ANFIS. Findings and Discussion: Based on the findings, ten main extracted constructs can be suggested for the Performance evaluation of the supply chain. They include "Operational Performance (OP)", "Strategic Performance (SP)", "Financial Performance (FP)", "Performance of Information and Communication Technology (PICT)", “ Return Performance” (REP), “ Risk Performance (RIP)” , “ Logistic Performance (LP)” , “ Market Performance (MP)” , “ Internal Structure Performance (PIS)” and “ Growth and Innovation Performance (PGI)” , among which, the Strategic Performance (SP) and Return Performance (REP) are the most important and the least important constructs, respectively. Conclusions Based on the findings, the following practical recommendations are suggested to the companies: · Enhancing the demand forecasts performance and utilizing more appropriate methods and software to improve forecasts in demand and order management areas. · Improving the return management status by increased attention and more investment in return management processes. · Effective investment in service development management to enhance the R&D services performance. · Utilizing risk management approaches and methods to identify and take preventive actions on the risks in the companies’ service supply chain.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    Hashemi, Seyedeh Nahid, & HUSSEINZADEH KASHAN, ALI. (2020). branch and bound algorithm equipped with tighter lower bound values for makespan minimization on a batch processing machine. PRODUCTION AND OPERATIONS MANAGEMENT, 10(2 (19) ), 00-00. SID. https://sid.ir/paper/404704/en

    Vancouver: Copy

    Hashemi Seyedeh Nahid, HUSSEINZADEH KASHAN ALI. branch and bound algorithm equipped with tighter lower bound values for makespan minimization on a batch processing machine. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2020;10(2 (19) ):00-00. Available from: https://sid.ir/paper/404704/en

    IEEE: Copy

    Seyedeh Nahid Hashemi, and ALI HUSSEINZADEH KASHAN, “branch and bound algorithm equipped with tighter lower bound values for makespan minimization on a batch processing machine,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 10, no. 2 (19) , pp. 00–00, 2020, [Online]. Available: https://sid.ir/paper/404704/en

    Related Journal Papers

    Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top