Paper Information

Journal:   JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS)   2016 , Volume 4 , Number 9 (SPECIAL ISSUE) #E0046; Page(s) 297 To 305.
 
Paper: 

DEVELOPING A NEW APPROXIMATION ALGORITHM WITH A TIGHT WORST-CASE FOR A SINGLE MACHINE SCHEDULING PROBLEM WITH TOOL CHANGE AND SPECIAL JOBS

 
 
Author(s):  AHMADI DARANI M.H., REISI NAFCHI M.*
 
* DEPARTMENT OF INDUSTRIAL AND SYSTEMS ENGINEERING, ISFAHAN UNIVERSITY OF TECHNOLOGY, IRAN
 
Abstract: 

Scheduling problems with tool changes considerations have been investigated extensively in the last two decades. Tool change activities applied in flexible maintenance activities where the tools may be changed at any time of their lifespan. Also, to determining the quality of the final product, considering the quality of the tools as a production condition items is inevitable. In this paper, the classical single machine scheduling problem with tool change is examined. In this problem, two sets of jobs, namely special jobs and normal jobs are considered. Special jobs must be processed during a certain time after the tool change. This problem has been studied in the literature. Mathematical programming models used to solve scheduling problems with small size and medium size. For scheduling problems with large size, six algorithms based on Bin Packing problem presented and focused on their performance. In this paper, we present a new algorithm for solving large size scheduling problems.
The computational results show that the proposed algorithm performance at the half of instance problems is better than four algorithms of literature. In addition, in the other instance it is better than all developed literature algorithms.

 
Keyword(s): SCHEDULING, SINGLE MACHINE, TOOL CHANGE, APPROXIMATION ALGORITHM
 
References: 
  • ندارد
 
  Persian Abstract Yearly Visit 49
 
Latest on Blog
Enter SID Blog