View in EDS

Min–max regret-based robust makespan minimization of the unrelated parallel batch processing machine scheduling problem with uncertain processing time.

Saved in:
Bibliographic Details
Title: Min–max regret-based robust makespan minimization of the unrelated parallel batch processing machine scheduling problem with uncertain processing time.
Authors: Ji, Bin1, chcujibin@csu.edu.cn, Xiao, Xin1, Yu, Samson S.2, Zhang, Dezhi1
Source: Engineering Optimization; Jun2026, Vol. 58 Issue 6, p1631-1651, 21p
Database: Applied Science & Technology Source
FullText Text:
  Availability: 0
Header DbId: aci
DbLabel: Applied Science & Technology Source
An: 194058752
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Min–max regret-based robust makespan minimization of the unrelated parallel batch processing machine scheduling problem with uncertain processing time.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AU" term="%22Ji%2C+Bin%22">Ji, Bin</searchLink><relatesTo>1</relatesTo>, <i>chcujibin@csu.edu.cn</i><br /><searchLink fieldCode="AU" term="%22Xiao%2C+Xin%22">Xiao, Xin</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AU" term="%22Yu%2C+Samson+S%2E%22">Yu, Samson S.</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AU" term="%22Zhang%2C+Dezhi%22">Zhang, Dezhi</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Engineering+Optimization%22">Engineering Optimization</searchLink>; Jun2026, Vol. 58 Issue 6, p1631-1651, 21p
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=194058752
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/0305215X.2025.2527731
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 1631
    Titles:
      – TitleFull: Min–max regret-based robust makespan minimization of the unrelated parallel batch processing machine scheduling problem with uncertain processing time.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Ji, Bin
      – PersonEntity:
          Name:
            NameFull: Xiao, Xin
      – PersonEntity:
          Name:
            NameFull: Yu, Samson S.
      – PersonEntity:
          Name:
            NameFull: Zhang, Dezhi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 0305215X
          Numbering:
            – Type: volume
              Value: 58
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: Engineering Optimization
              Type: main
ResultId 1