JIT single machine scheduling problem with periodic preventive maintenance


  • Amir Ebrahimi Zade Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran
  • Mani Sharifi Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
  • Mohammadreza Shahriari Faculty of Management, South Tehran Branch, Islamic Azad University, Tehran, Iran
  • Naghi Shoja Department of Industrial Engineering, Firoozkooh Branch, Islamic Azad University, Firoozkooh, Iran
  • Sasan Barak Faculty of Economics, Technical University of Ostrava, Ostrava, Czech Republic

This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms’ parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دسترسی به متن کامل این مقاله و 23 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

a heuristic algorithm for solving single machine scheduling problem with periodic maintenance

in this paper, the scheduling problem with nonresumable jobs and maintenance process is considered in order to minimize the makespan under two alternative strategies. the first strategy is to implement the maintenance process on the machine after a predetermined time period and the second one is to consider the maximum number of jobs that can be done with a special tool. we have proposed a new ...

متن کامل

Single-machine scheduling with periodic maintenance to minimize makespan

We consider a single-machine scheduling problem with periodic maintenance activities. Although the scheduling problem with maintenance has attracted researchers’ attention, most of past studies considered only one maintenance period. In this research several maintenance periods are considered where each maintenance activity is scheduled after a periodic time interval. The objective is to find a...

متن کامل

Periodic flexible maintenance planning in a single-machine production environment

Preventive maintenance is the essential part of many maintenance plans. From the production point of view, the flexibility of the maintenance intervals enhances the manufacturing efficiency. On the contrary, the maintenance departments tend to know the timing of the long term maintenance plans as certain as possible. In a single-machine production environment, this paper proposes a simulation–o...

متن کامل

Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs

This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...

متن کامل

Single-machine Scheduling with Periodic and Exible Periodic Maintenance to Minimize Maximum Tardiness

This paper considers a single machine scheduling problem with several mainte-nances periods. Specically, two situations are investigated. In the rst one, maintenance periods are periodically xed: maintenance is required after a periodic time interval. In the second one, the maintenance is not xed but the maximum continuous working time of the machine which is allowed is determined. The objectiv...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}

  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

دانلود متن کامل

برای دسترسی به متن کامل این مقاله و 23 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 12  شماره 3

صفحات  -

تاریخ انتشار 2016-09-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2022