Optimization Online


New VNS heuristic for Total Flowtime Flowshop Scheduling Problem

Wagner Emanoel Costa (wemano***at***gmail.com)
Marco César Goldbarg (gold***at***dimap.ufrn.br)
Elizabeth G. Goldbarg (beth***at***dimap.ufrn.br)

Abstract: This paper develops a new VNS approach to Permutational Flow shop Scheduling Problem with Total Flow time criterion. There are many hybrid approaches inthe problem’s literature, that make use of VNS internally, usually applying job insert neighbourhood followed by job interchange neighbourhood. In this study different ways to combine both neighbourhoods were examined. All tests use the benchmark data set from [18]. The results indicates, that there is a more profitable way to combine both neighbourhoods than the one frequently used in literature. The new VNS produces results comparable with state-of-art methods, and obtained 25 novel solutions.

Keywords: Scheduling, Flowshop, Total Flow-time, Heuristics, VNS.

Category 1: Applications -- OR and Management Sciences (Scheduling )

Category 2: Combinatorial Optimization (Meta Heuristics )

Citation: The paper has been accepted. It is online on http://dx.doi.org/10.1016/j.eswa.2012.01.152


Entry Submitted: 03/15/2011
Entry Accepted: 03/18/2011
Entry Last Modified: 02/03/2012

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society