Paper Title:
Minimizing the Number of Tardy Jobs in Flow Shop Sequence Dependent Setup Times Scheduling Problem
  Abstract

This paper investigates permutation flow shop scheduling problems with sequence-dependent setup times with minimizing the number of tardy jobs as criterion (Fm|prmu, Sijk|∑Uj). Since the proposed research problem has been proven to be NP-hard, three different meta heuristic algorithms based on tabu search (TS) has been proposed to solve the problem. These three algorithms are different based on their tabu list characteristics. In order to evaluate the performance of the proposed TS algorithms, test problems in different ranges are generated to find the best algorithm. The comparison shows that the TS algorithm which its tabu list keeps track of the slots that the jobs are assigned has a better performance than the other algorithms

  Info
Periodical
Chapter
Chapter 20: Manufacturing Process Planning and Scheduling
Edited by
Wu Fan
Pages
4063-4069
DOI
10.4028/www.scientific.net/AMM.110-116.4063
Citation
M. Varmazyar, N. Salmasi, "Minimizing the Number of Tardy Jobs in Flow Shop Sequence Dependent Setup Times Scheduling Problem", Applied Mechanics and Materials, Vols. 110-116, pp. 4063-4069, 2012
Online since
October 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Xin Ning, Wen Han Liu
Chapter 1: Manufacturing Technology and Processing
Abstract:A good site layout can promote site safety and efficient operations. Previous research of this area focused on genetic algorithms, simulated...
128
Authors: V. Govindarajalu, V.S. Senthil Kumar
Chapter 12: Manufacturing Process Planning and Scheduling
Abstract:This paper considers the problem of scheduling production activities in a real-life printing industry. The problem is modeled as a two-stage...
1119
Authors: Seong Woo Choi
Chapter 5: Mechanical Engineering and Design, Manufacturing Technologies
Abstract:We focus on an m-machine re-entrant flowshop scheduling problem with the objective of minimizing total tardiness. In the re-entrant flowshop...
890