Welcome to the InfoSci Platform
Reference Hub6
A Non-Permutation Flow Shop Manufacturing Cell Scheduling Problem with Part's Sequence Dependent Family Setup Times

A Non-Permutation Flow Shop Manufacturing Cell Scheduling Problem with Part's Sequence Dependent Family Setup Times

Behzad Nikjo, Yaser Zarook
Copyright: © 2014 |Volume: 5 |Issue: 4 |Pages: 17
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781466652644|DOI: 10.4018/ijamc.2014100104
Cite Article Cite Article

MLA

Nikjo, Behzad, and Yaser Zarook. "A Non-Permutation Flow Shop Manufacturing Cell Scheduling Problem with Part's Sequence Dependent Family Setup Times." IJAMC vol.5, no.4 2014: pp.70-86. http://doi.org/10.4018/ijamc.2014100104

APA

Nikjo, B. & Zarook, Y. (2014). A Non-Permutation Flow Shop Manufacturing Cell Scheduling Problem with Part's Sequence Dependent Family Setup Times. International Journal of Applied Metaheuristic Computing (IJAMC), 5(4), 70-86. http://doi.org/10.4018/ijamc.2014100104

Chicago

Nikjo, Behzad, and Yaser Zarook. "A Non-Permutation Flow Shop Manufacturing Cell Scheduling Problem with Part's Sequence Dependent Family Setup Times," International Journal of Applied Metaheuristic Computing (IJAMC) 5, no.4: 70-86. http://doi.org/10.4018/ijamc.2014100104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This article presents a new mathematical model for a dynamic flow shop manufacturing cell scheduling problem (DFMCSP) with agreeable job release date for each part family where family setup times are dependent on sequence of parts within families. It means this article considers non-permutation schedules for both sequence of families and sequence of parts within families. The objective is minimizing the Makespan (Cmax). Since, this problem belongs to NP-Hard class. Therefore, reaching an optimal solution in a reasonable computational time by using exact methods is extremely difficult. Thus, this article proposes meta-heuristic methods such as Genetic Algorithms (GA) and Tabu Search (TS). Finally, the computational results compare efficiency of the proposed algorithms under the performance measures.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.