In EDS ansehen

An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine.

Gespeichert in:
Bibliographische Detailangaben
Titel: An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine.
Autoren: Wang, Hanpeng, Xiong, Hengen, Zuo, Wenlu, Shi, Shuangyuan
Quelle: Scientific Reports; 4/7/2025, Vol. 15 Issue 1, p1-27, 27p
Schlagwörter: PRODUCTION scheduling, DECODING algorithms, PARALLEL processing, SEARCH algorithms, BATCH processing, MOLDS (Casts & casting)
Abstract: This paper addresses a hybrid processing system in automotive mold casting, which involves single processing machines and parallel batch processing machines. A job shop scheduling problem with parallel batch processing machines (JSP-PBPM) is developed, with the objective of minimizing the maximum completion time. First, a solution decoding strategy combined with the JSP-PBPM problem and a batch job addition algorithm is proposed. This approach addresses the impact of operation precedence relationships on conventional decoding strategies and aims to maximize the utilization of parallel batch processing machines for batch operations. Next, an Improved Scatter Search (ISS) algorithm is introduced to solve the problem. The ISS algorithm finds the optimal solution through several steps, including the construction of the initial population, improvement of the initial solution, creation of a reference set, generation of subsets, and refinement of the final solution. Finally, simulation experiments are conducted to verify the feasibility and effectiveness of the proposed algorithm and decoding strategy in solving such problems. [ABSTRACT FROM AUTHOR]
Copyright of Scientific Reports is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?cmd=search&db=pmc&term=2045-2322[TA]+AND+1[PG]+AND+2025[PDAT]
    Name: FREE - PubMed Central (ISSN based link)
    Category: fullText
    Text: Full Text
    Icon: https://imageserver.ebscohost.com/NetImages/iconPdf.gif
    MouseOverText: Check this PubMed for the article full text.
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=20452322&ISBN=&volume=15&issue=1&date=20250407&spage=1&pages=1-27&title=Scientific Reports&atitle=An%20improved%20scatter%20search%20algorithm%20for%20solving%20job%20shop%20scheduling%20problems%20with%20parallel%20batch%20processing%20machine.&aulast=Wang%2C%20Hanpeng&id=DOI:10.1038/s41598-025-92761-8
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Wang%20H
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edb
DbLabel: Complementary Index
An: 184383874
RelevancyScore: 1023
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1023.07348632813
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Wang%2C+Hanpeng%22">Wang, Hanpeng</searchLink><br /><searchLink fieldCode="AR" term="%22Xiong%2C+Hengen%22">Xiong, Hengen</searchLink><br /><searchLink fieldCode="AR" term="%22Zuo%2C+Wenlu%22">Zuo, Wenlu</searchLink><br /><searchLink fieldCode="AR" term="%22Shi%2C+Shuangyuan%22">Shi, Shuangyuan</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Scientific Reports; 4/7/2025, Vol. 15 Issue 1, p1-27, 27p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22PRODUCTION+scheduling%22">PRODUCTION scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22DECODING+algorithms%22">DECODING algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22PARALLEL+processing%22">PARALLEL processing</searchLink><br /><searchLink fieldCode="DE" term="%22SEARCH+algorithms%22">SEARCH algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22BATCH+processing%22">BATCH processing</searchLink><br /><searchLink fieldCode="DE" term="%22MOLDS+%28Casts+%26+casting%29%22">MOLDS (Casts & casting)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper addresses a hybrid processing system in automotive mold casting, which involves single processing machines and parallel batch processing machines. A job shop scheduling problem with parallel batch processing machines (JSP-PBPM) is developed, with the objective of minimizing the maximum completion time. First, a solution decoding strategy combined with the JSP-PBPM problem and a batch job addition algorithm is proposed. This approach addresses the impact of operation precedence relationships on conventional decoding strategies and aims to maximize the utilization of parallel batch processing machines for batch operations. Next, an Improved Scatter Search (ISS) algorithm is introduced to solve the problem. The ISS algorithm finds the optimal solution through several steps, including the construction of the initial population, improvement of the initial solution, creation of a reference set, generation of subsets, and refinement of the final solution. Finally, simulation experiments are conducted to verify the feasibility and effectiveness of the proposed algorithm and decoding strategy in solving such problems. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of Scientific Reports is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=184383874
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1038/s41598-025-92761-8
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 27
        StartPage: 1
    Subjects:
      – SubjectFull: PRODUCTION scheduling
        Type: general
      – SubjectFull: DECODING algorithms
        Type: general
      – SubjectFull: PARALLEL processing
        Type: general
      – SubjectFull: SEARCH algorithms
        Type: general
      – SubjectFull: BATCH processing
        Type: general
      – SubjectFull: MOLDS (Casts & casting)
        Type: general
    Titles:
      – TitleFull: An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Wang, Hanpeng
      – PersonEntity:
          Name:
            NameFull: Xiong, Hengen
      – PersonEntity:
          Name:
            NameFull: Zuo, Wenlu
      – PersonEntity:
          Name:
            NameFull: Shi, Shuangyuan
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 07
              M: 04
              Text: 4/7/2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 20452322
          Numbering:
            – Type: volume
              Value: 15
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Scientific Reports
              Type: main
ResultId 1