Efficient Dispatching Rules Based on Data Mining for the Single Machine Scheduling Problem

نویسندگان

  • Mohamed Habib Zahmani
  • Baghdad Atmani
  • Abdelghani Bekrar
چکیده

In manufacturing the solutions found for scheduling problems and the human expert’s experience are very important. They can be transformed using Artificial Intelligence techniques into knowledge and this knowledge could be used to solve new scheduling problems. In this paper we use Decision Trees for the generation of new Dispatching Rules for a Single Machine shop solved using a Genetic Algorithm. Two heuristics are proposed to use the new Dispatching Rules and a comparative study with other Dispatching Rules from the literature is presented.

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

ثبت نام

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

منابع مشابه

A Mathematical Programming Model and Genetic Algorithm for a Multi-Product Single Machine Scheduling Problem with Rework Processes

In this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. We concern rework in the scheduling environment and propose a mixed-integer programming (MIP) model for the problem.  Based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...

متن کامل

Learning dispatching rules via an association rule mining approach

This thesis proposes a new idea using association rule mining-based approach for discovering dispatching rules in production data. Decision trees have previously been used for the same purpose of finding dispatching rules. However, the nature of the decision tree as a classification method may cause incomplete discovery of dispatching rules, which can be complemented by association rule mining ...

متن کامل

Net Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

متن کامل

Net Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

متن کامل

Classification Rules for the Job Shop Scheduling Problem with Machine Breakdowns

This paper addresses the job shop scheduling problem in the presence of machine breakdowns. In this work, we propose to exploit the advantages of data mining techniques to resolve the problem. We proposed an approach to discover a set of classification rules by using historic scheduling data. Intelligent decisions are then made in real time based on this constructed rules to assign the correspo...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2015