> Detailanzeige

Zeng, Chengkuan; Chen, Shiming; Yan, Chongjun

Auction- and negotiation-based approach with local search for cellular manufacturing systems under traffic jam constraints in magnetic production enterprises

Literatur-
verwaltung

Zur
Merkliste

Lösche von
Merkliste

Per Whatsapp teilen

Schließen

Merkliste



Sie können Bookmarks mittels Listen verwalten, loggen Sie sich dafür bitte in Ihr SLUB Benutzerkonto ein.
  • Medientyp: E-Artikel
  • Titel: Auction- and negotiation-based approach with local search for cellular manufacturing systems under traffic jam constraints in magnetic production enterprises
  • Beteiligte: Zeng, Chengkuan; Chen, Shiming; Yan, Chongjun
  • Erschienen: Emerald, 2023
  • Erschienen in: Kybernetes
  • Sprache: Englisch
  • DOI: 10.1108/k-04-2023-0545
  • ISSN: 0368-492X
  • Schlagwörter: Computer Science (miscellaneous) ; Social Sciences (miscellaneous) ; Theoretical Computer Science ; Control and Systems Engineering ; Engineering (miscellaneous)
  • Entstehung:
  • Anmerkungen:
  • Beschreibung: <jats:sec><jats:title content-type="abstract-subheading">Purpose</jats:title><jats:p>This study addresses the production optimization of a cellular manufacturing system (CMS) in magnetic production enterprises. Magnetic products and raw materials are more critical to transport than general products because the attraction or repulsion between magnetic poles can easily cause traffic jams. This study needs to address a method to promote the scheduling efficiency of the problem.</jats:p></jats:sec><jats:sec><jats:title content-type="abstract-subheading">Design/methodology/approach</jats:title><jats:p>To address this problem, this study formulated a mixed-integer linear programming (MILP) model to describe the problem and proposed an auction and negotiation-based approach with a local search to solve it. Auction- and negotiation-based approaches can obtain feasible and high-quality solutions. A local search operator was proposed to optimize the feasible solutions using an improved conjunctive graph model.</jats:p></jats:sec><jats:sec><jats:title content-type="abstract-subheading">Findings</jats:title><jats:p>Verification tests were performed on a series of numerical examples. The results demonstrated that the proposed auction and negotiation-based approach with a local search operator is better than existing solution methods for the problem identified. Statistical analysis of the experiment results using the Statistical Package for the Social Sciences (SPSS) software demonstrated that the proposed approach is efficient, stable and suitable for solving large-scale numerical instances.</jats:p></jats:sec><jats:sec><jats:title content-type="abstract-subheading">Originality/value</jats:title><jats:p>An improved auction and negotiation-based approach was proposed; The conjunctive graph model was also improved to describe the problem of CMS with traffic jam constraint and build the local search operator; The authors’ proposed approach can get better solution than the existing algorithms by testing benchmark instances and real-world instances from enterprises.</jats:p></jats:sec>