Shop Floor Scheduling Using Tabu Search

نویسنده

  • Chuen-Lung Chen
چکیده

摘要 現場管制系統是ERP的主要子系統之一, 其主要功能是安排現場訂單的排程. 根據研 究,大部分現場的排程問題是屬於 Job Shop問 題. 所以過去幾十年來 Job Shop問題一直是 產業界與學術界重要的研究課題之一. 其間 雖有無數的論文發表, 但因缺少考慮現場實際 的狀況, 很少研究的成果可以用來解決現場的 排程問題. 本研究開發以 Tabu Search為主的 排程方法. 經以個人在美國工作現場所使用之 MRP II 系統所產生的資料驗證, 本方法確能 有效求解現場的排程問題. 關鍵字: Job Shop, Tabu Search Abstract Shop floor control system is a sub-system of the ERP system. Its major function is to generate daily schedules for the jobs on the shop floor. Job shop scheduling is the major task in shop floor control within industries. Due to its computational intractability, the development of effective algorithms for solving job shop problems have been a great challenge for researchers in industry and academia for decades. Although a lot of research has been developed for job shop problems, most of them did not consider practical factors on the shop floor such as job priority, outside resources, unequal worker-center capacity, dynamic events, and database management. Therefore, very few of the results can be applied to solve practical job shop problems on the shop floor. The objective of this study is to develop a TS-based heuristic to cope with practical job shop problems. The problems are generated by a well-known MRP II system (CONTROL) used by a manufacturing company in Jackson, Mississippi. Computational analysis has shown that the TS-based heuristic is an effective and efficient tool for practical job shop problems.

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

ثبت نام

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

منابع مشابه

Flow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search

Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...

متن کامل

An Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations

Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...

متن کامل

A Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach (RESEARCH NOTE)

This paper proposes a novel, bi-objective mixed-integer mathematical programming for an open shop scheduling problem (OSSP) that minimizes the mean tardiness and the mean completion time. To obtain the efficient (Pareto-optimal) solutions, a fuzzy multi-objective decision making (fuzzy MODM) approach is applied. By the use of this approach, the related auxiliary single objective formulation can...

متن کامل

Simultaneous production planning and scheduling in a hybrid flow shop with time periods and work shifts

Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...

متن کامل

Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling

This paper presents a new algorithm based on integrating Genetic Algorithms and Tabu Search methods to solve the Job Shop Scheduling problem. The idea of the proposed algorithm is derived from Genetic Algorithms. Most of the scheduling problems require either exponential time or space to generate an optimal answer. Job Shop scheduling (JSS) is the general scheduling problem and it is a NP-compl...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2001