Affordable Access

Publisher Website

An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems

Authors
Journal
Computers & Operations Research
0305-0548
Publisher
Elsevier
Publication Date
Volume
36
Issue
9
Identifiers
DOI: 10.1016/j.cor.2008.11.004
Keywords
  • Estimation Of Distribution Algorithm
  • Variable Neighbourhood Search
  • Scheduling
  • Permutation Flowshop
  • Flowtime
Disciplines
  • Computer Science

Abstract

Abstract In this work we propose an estimation of distribution algorithm (EDA) as a new tool aiming at minimizing the total flowtime in permutation flowshop scheduling problems. A variable neighbourhood search is added to the algorithm as an improvement procedure after creating a new offspring. The experiments show that our approach outperforms all existing techniques employed for the problem and can provide new upper bounds.

There are no comments yet on this publication. Be the first to share your thoughts.