View in EDS HTML Full Text PDF Full Text

A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor.

Saved in:
Bibliographic Details
Title: A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor.
Authors: Li, Shuguang1 (AUTHOR) sgliytu@hotmail.com, Wei, Jing1 (AUTHOR) 2023420185@sdtbu.edu.cn, Liang, Yanyue1 (AUTHOR) 2021410063@sdtbu.edu.cn, Shen, Haoxuan1 (AUTHOR) 2021410051@sdtbu.edu.cn, Simic, Vladimir2,3,4 (AUTHOR) vsima@sf.bg.ac.rs, Pamucar, Dragan5,6 (AUTHOR) dragan.pamucar@fon.bg.ac.rs
Source: Central European Journal of Operations Research. Mar2026, Vol. 34 Issue 1, p161-181. 21p.
Database: Business Source Ultimate
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: bsu
DbLabel: Business Source Ultimate
An: 190821115
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Li%2C+Shuguang%22">Li, Shuguang</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> sgliytu@hotmail.com</i><br /><searchLink fieldCode="AR" term="%22Wei%2C+Jing%22">Wei, Jing</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> 2023420185@sdtbu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Liang%2C+Yanyue%22">Liang, Yanyue</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> 2021410063@sdtbu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Shen%2C+Haoxuan%22">Shen, Haoxuan</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> 2021410051@sdtbu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Simic%2C+Vladimir%22">Simic, Vladimir</searchLink><relatesTo>2,3,4</relatesTo> (AUTHOR)<i> vsima@sf.bg.ac.rs</i><br /><searchLink fieldCode="AR" term="%22Pamucar%2C+Dragan%22">Pamucar, Dragan</searchLink><relatesTo>5,6</relatesTo> (AUTHOR)<i> dragan.pamucar@fon.bg.ac.rs</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Central+European+Journal+of+Operations+Research%22">Central European Journal of Operations Research</searchLink>. Mar2026, Vol. 34 Issue 1, p161-181. 21p.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsu&AN=190821115
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10100-024-00954-9
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 161
    Titles:
      – TitleFull: A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Li, Shuguang
      – PersonEntity:
          Name:
            NameFull: Wei, Jing
      – PersonEntity:
          Name:
            NameFull: Liang, Yanyue
      – PersonEntity:
          Name:
            NameFull: Shen, Haoxuan
      – PersonEntity:
          Name:
            NameFull: Simic, Vladimir
      – PersonEntity:
          Name:
            NameFull: Pamucar, Dragan
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 1435246X
          Numbering:
            – Type: volume
              Value: 34
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Central European Journal of Operations Research
              Type: main
ResultId 1