<?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-015-09-1907</article-id>
      <article-id pub-id-type="publisher-id">29452</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>I.1.2 - Algorithms</subject>
          <subject>I.1.4 - Applications</subject>
          <subject>I.2.1 - Applications and Expert Systems</subject>
          <subject>I.2.4 - Knowledge Representation Formalisms and Methods</subject>
          <subject>J.6 - COMPUTER-AIDED ENGINEERING</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Application of Intelligent Strategies for Cooperative Manufacturing 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>Weidong</given-names>
          </name>
          <email xlink:type="simple">weidong.li@coventry.ac.uk</email>
          <xref ref-type="aff" rid="A1">1</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="A2">2</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Li</surname>
            <given-names>Xinyu</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">Coventry University, Coventry, United Kingdom</addr-line>
        <institution>Coventry University</institution>
        <addr-line content-type="city">Coventry</addr-line>
        <country>United Kingdom</country>
      </aff>
      <aff id="A2">
        <label>2</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>
      <aff id="A3">
        <label>3</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>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Weidong Li (<email xlink:type="simple">weidong.li@coventry.ac.uk</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2009</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>05</month>
        <year>2009</year>
      </pub-date>
      <volume>15</volume>
      <issue>9</issue>
      <fpage>1907</fpage>
      <lpage>1923</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/3BF8AD60-878C-5A6C-90A2-B11091261EF0">3BF8AD60-878C-5A6C-90A2-B11091261EF0</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/7000855">7000855</uri>
      <permissions>
        <copyright-statement>Weidong Li, Liang Gao, Xinyu Li</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>Manufacturing planning is crucial for the quality and efficiency of product development. Process planning and scheduling are the most important and challenging tasks in manufacturing planning. These two processes are usually arranged in a sequential way. Recently, a significant trend is to make the processes to work more concurrently and cooperatively to achieve a globally optimal result. In this paper, several intelligent strategies have been developed to build up Cooperative Process Planning and Scheduling (CPPS). Three Game Theory-based strategies, i.e., Pareto strategy, Nash strategy and Stackelberg strategy, have been introduced to analyze the cooperative integration of the two processes in a systematic way. To address the multiple constraints in CPPS, a fuzzy logic-based Analytical Hierarchical Process (AHP) technique has been applied. Modern heuristic algorithms, including Particle Swarm Optimization (PSO), Simulated Annealing (SA) and Genetic Algorithms (GAs), have been developed and applied to CPPS to identify optimal or near-optimal solutions from the vast search space efficiently. Experiments have been conducted and results show the objectives of the research have been achieved.</p>
      </abstract>
    </article-meta>
  </front>
</article>
