Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm

نویسندگان

  • Mohammad Asghari Department of industrial engineering, Ferdowsi University of Mashhad, Azadi Sq., Mashhad, Iran
  • Samaneh Nezhadali Department of management, Iran Chamber of Commerce, Industries and Mines, Mashhad, Iran
چکیده مقاله:

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for appraising a multi-objective programing that minimize total weighted tardiness, earliness and total flowtime with fuzzy parameters on parallel machines, simultaneously with respect to the impact of machine deterioration. Besides, in this paper is attempted to present a defuzzification approach and a heuristic method based genetic algorithm (GA) to solve the proposed model. Finally, several dominance properties of optimal solutions are demonstrated in comparison with the results of a state-of-the-art commercial solver and the simulated annealing method that is followed by illustrating some instances for indicating validity and efficiency of the method.

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

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

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

منابع مشابه

Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...

متن کامل

fuzzy programming for parallel machines scheduling: minimizing weighted tardiness/earliness and flow time through genetic algorithm

appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. one type of scheduling problems is just-in-time (jit) scheduling and in this area, motivated by jit manufacturing, this study investigates a mathematical model for...

متن کامل

Weighted Flowtime on Capacitated Machines

It is well-known that SRPT is optimal for minimizing flow time on machines that run one job at a time. However, running one job at a time is a big underutilization for modern systems where sharing, simultaneous execution, and virtualization-enabled consolidation are a common trend to boost utilization. Such machines, used in modern large data centers and clouds, are powerful enough to run multi...

متن کامل

Electromagnetism-like algorithm for fuzzy flow shop batch processing machines scheduling to minimize total weighted earliness and ‎tardiness‎

‎In this paper, we study a flow shop batch processing machines scheduling problem. The fuzzy due dates are considered to make the problem more close to the reality. The objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. In order to tackle the given problem, we propose a hybrid electromagnetism-like (EM) algorithm, in which the EM is hybridized with a diversi...

متن کامل

A New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm

This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...

متن کامل

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

متن کامل

منابع من

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

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

{@ msg_add @}


عنوان ژورنال

دوره 9  شماره 20

صفحات  19- 30

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

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

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

copyright © 2015-2023