1 Ocak 2012 Konferans bildirisi Açık Erişim

Tasgetiren, M. Fatih; Pan, Quan-Ke; Wang, Ling; Chen, Angela H. -L.

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/87813</identifier>
  <creators>
    <creator>
      <creatorName>Tasgetiren, M. Fatih</creatorName>
      <givenName>M. Fatih</givenName>
      <familyName>Tasgetiren</familyName>
      <affiliation>Yasar Univ, Dept Ind Engn, Izmir, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Pan, Quan-Ke</creatorName>
      <givenName>Quan-Ke</givenName>
      <familyName>Pan</familyName>
      <affiliation>Liaocheng Univ, Sch Comp Sci, Liaocheng, Peoples R China</affiliation>
    </creator>
    <creator>
      <creatorName>Wang, Ling</creatorName>
      <givenName>Ling</givenName>
      <familyName>Wang</familyName>
      <affiliation>Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China</affiliation>
    </creator>
    <creator>
      <creatorName>Chen, Angela H. -L.</creatorName>
      <givenName>Angela H. -L.</givenName>
      <familyName>Chen</familyName>
      <affiliation>Nanya Inst Technol, Dept Finance, Chungli 320, Taiwan</affiliation>
    </creator>
  </creators>
  <titles>
    <title>A De Based Variable Iterated Greedy Algorithm For The No-Idle Permutation Flowshop Scheduling Problem With Total Flowtime Criterion</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2012</publicationYear>
  <dates>
    <date dateType="Issued">2012-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Conference paper</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/87813</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.81043/aperta.87812</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.81043/aperta.87813</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">In this paper, we present a variable iterated greedy (vIGP_DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the differential evolution algorithm. A unique multi-chromosome solution representation is presented such that first chromosome represents the destruction size and cooling parameter of the iterated greedy algorithm while second chromosome is simply a permutation assigned to each individual in the population randomly. As an application area, we choose to solve the no-idle permutation tlowshop scheduling problem with the total flowtime criterion. To the best of our knowledge, the no-idle permutation flowshop problem hasn't yet been studied thought it's a variant of the well-known permutation flowshop scheduling problem. The performance of the vIGP_DE algorithm is tested on the Tail lard's benchmark suite and compared to a very recent variable iterated greedy algorithm from the existing literature. The computational results show its highly competitive performance and ultimately, we provide the best known solutions for the total flowtime criterion for the Tail lard's benchmark suit.</description>
  </descriptions>
</resource>