A double relaxation grasp algorithm to solve the flowshop scheduling problem

Manuel Tupia, César Ramírez

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Most production lines do not present an adequate way to plan their production, deciding for manual distribution and depending on the knowledge of their line or plant managers. This leads to a bad utilization of the resources, since conventional planning methods avoid considering complicated configurations. The kind of production line studied in this paper is flow shop scheduling (FSS hereafter) where tasks are independent and machines are homogeneous (they take almost the same time to perform a task), the machines are divided in families according to the function they have (FSS will force tasks to go through all the families) In this paper we present a GRASP metaheuristic algorithm to optimize lines as those defined above. The novelty is in the double relaxation criteria for both machines and tasks.

Original languageEnglish
Title of host publication20th International Conference on Computer Applications in Industry and Engineering 2007, CAINE 2007
Pages1-4
Number of pages4
StatePublished - 2007
Event20th International Conference on Computer Applications in Industry and Engineering 2007, CAINE 2007 - San Francisco, CA, United States
Duration: 7 Nov 20079 Nov 2007

Publication series

Name20th International Conference on Computer Applications in Industry and Engineering 2007, CAINE 2007

Conference

Conference20th International Conference on Computer Applications in Industry and Engineering 2007, CAINE 2007
Country/TerritoryUnited States
CitySan Francisco, CA
Period7/11/079/11/07

Keywords

  • Artificial intelligence
  • Flow-shop scheduling
  • GRASP algorithms
  • Metaheuristics

Fingerprint

Dive into the research topics of 'A double relaxation grasp algorithm to solve the flowshop scheduling problem'. Together they form a unique fingerprint.

Cite this