<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-020-14-1926</article-id>
      <article-id pub-id-type="publisher-id">23866</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>J.6 - COMPUTER-AIDED ENGINEERING</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>An Effective Genetic Algorithm for Multi-objective Integrated Process Planning and Scheduling with Various Flexibilities in Process Planning</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Li</surname>
            <given-names>Xinyu</given-names>
          </name>
          <email xlink:type="simple">lixinyu@mail.hust.edu.cn</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Wen</surname>
            <given-names>Xiaoyu</given-names>
          </name>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Gao</surname>
            <given-names>Liang</given-names>
          </name>
          <xref ref-type="aff" rid="A3">3</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Huazhong University of Science and Technology, Wuhan, China</addr-line>
        <institution>Huazhong University of Science and Technology</institution>
        <addr-line content-type="city">Wuhan</addr-line>
        <country>China</country>
      </aff>
      <aff id="A2">
        <label>2</label>
        <addr-line content-type="verbatim">hengzhou University of Light Industry, Zhengzhou, China</addr-line>
        <institution>hengzhou University of Light Industry</institution>
        <addr-line content-type="city">Zhengzhou</addr-line>
        <country>China</country>
      </aff>
      <aff id="A3">
        <label>3</label>
        <addr-line content-type="verbatim">University of Science and Technology, Wuhan, China</addr-line>
        <institution>University of Science and Technology</institution>
        <addr-line content-type="city">Wuhan</addr-line>
        <country>China</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Xinyu Li (<email xlink:type="simple">lixinyu@mail.hust.edu.cn</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2014</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>12</month>
        <year>2014</year>
      </pub-date>
      <volume>20</volume>
      <issue>14</issue>
      <fpage>1926</fpage>
      <lpage>1950</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/F59F3020-9473-5D72-AAF7-DCD3BF8BC10C">F59F3020-9473-5D72-AAF7-DCD3BF8BC10C</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/5506023">5506023</uri>
      <history>
        <date date-type="received">
          <day>12</day>
          <month>01</month>
          <year>2014</year>
        </date>
        <date date-type="accepted">
          <day>06</day>
          <month>09</month>
          <year>2014</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>Xinyu Li, Xiaoyu Wen, Liang Gao</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Process planning and scheduling are two of the most important functions in modern manufacturing system. Considering their complementarity, integrating them more tightly can improve the performance and productivity of the whole manufacturing system. Meanwhile, the multi-objective optimization problem is widespread existing in manufacturing system. In this paper, an effective genetic algorithm is proposed to optimize the multi-objective integrated process planning and scheduling (IPPS) problem with various flexibilities in process planning. Three types of flexibilities related to process, sequence and machine are considered. And three objectives including makespan, total machine workload and maximal machine workload are taken into account simultaneously. According to the model and characteristics of multi-objective IPPS, the framework of the proposed algorithm is designed to optimize three objectives simultaneously. Effective genetic operations are employed in the proposed algorithm. Pareto set is set to store and maintain the solutions obtained during the searching procedure, the proposed algorithm could get several Pareto optimal solutions during one searching process. Two experiments are employed to test the performance of the proposed algorithm. The experiment results show that the proposed algorithm can solve multi-objective IPPS problem with various flexibilities in process planning effectively and obtain good solutions.</p>
      </abstract>
    </article-meta>
  </front>
</article>
