MAKESPAN MINIMIZATION ON IDENTICAL PARALLEL MACHINES SUBJECT TO MINIMUM TOTAL FLOW-TIME

We consider the problem of scheduling n jobs on m identical parallel machines. An optimal schedule to the proposed problem is defined as one that gives the smallest makespan (the completion time of the last job on any one of the parallel machines) among the set of all schedules with optimal total fl...

Full description

Saved in:
Bibliographic Details
Published inJournal of the Chinese Institute of Industrial Engineers Vol. 21; no. 3; pp. 220 - 229
Main Authors Gupta, Jatinder N. D., Ho, Johnny C., Ruiz-Torres, Alex J.
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.01.2004
Subjects
Online AccessGet full text
ISSN1017-0669
2151-7606
DOI10.1080/10170660409509403

Cover

Abstract We consider the problem of scheduling n jobs on m identical parallel machines. An optimal schedule to the proposed problem is defined as one that gives the smallest makespan (the completion time of the last job on any one of the parallel machines) among the set of all schedules with optimal total flowtime (the sum of the completion times of all jobs). We propose two new simple heuristic algorithms and empirically compare their effectiveness and efficiency with several existing algorithms.
AbstractList We consider the problem of scheduling n jobs on m identical parallel machines. An optimal schedule to the proposed problem is defined as one that gives the smallest makespan (the completion time of the last job on any one of the parallel machines) among the set of all schedules with optimal total flowtime (the sum of the completion times of all jobs). We propose two new simple heuristic algorithms and empirically compare their effectiveness and efficiency with several existing algorithms.
Author Ho, Johnny C.
Ruiz-Torres, Alex J.
Gupta, Jatinder N. D.
Author_xml – sequence: 1
  givenname: Jatinder N. D.
  surname: Gupta
  fullname: Gupta, Jatinder N. D.
  organization: College of Administrative Science University of Alabama in Huntsville
– sequence: 2
  givenname: Johnny C.
  surname: Ho
  fullname: Ho, Johnny C.
  organization: Department of Information and Decision Sciences , University of Texas
– sequence: 3
  givenname: Alex J.
  surname: Ruiz-Torres
  fullname: Ruiz-Torres, Alex J.
  organization: Department of Industrial Engineering , Polytechnic University of Puerto Rico
BookMark eNqNkN1Kw0AQhRepYK19AO_yAtHZzWa3AW9iTe1qfopNKXgTtpsNBNJENgHt27ulXimiMDAD53xnmLlEo7ZrNULXGG4wzOAWA-bAGFAIfAgoeGdoTLCPXc6AjdD4qLvWEFygad_XO8CMU_DBH6NtEj5H61WYOolIRSJew1xkqWNLPERpLuZh7KzClzCOo9hJwvlSpNHaWW_un6J57uTZCdskdsytdRFnWzcXSXSFzivZ9Hr61Sdos4jy-dKNs8djqKsIw4NLiGREB-CzsprRWUCVVoTvKsKp8rQXUB4QrUtMdszqilBpL1U-01wxXVa-N0H4lKtM1_dGV8WbqffSHAoMxfE5xY_nWIZ_Y1Q9yKHu2sHIuvkPWbdVZ_byvTNNWQzy0HSmMrJVdf-TKoaPwZJ3f5Le74s_AfeVhtU
CitedBy_id crossref_primary_10_1016_j_cie_2008_05_003
crossref_primary_10_4028_www_scientific_net_AMM_786_349
crossref_primary_10_1007_s10845_009_0270_1
Cites_doi 10.1016/S0377-2217(99)00386-0
10.1137/0207001
10.1016/S0305-0548(99)00083-0
10.1137/0218022
10.1287/opre.41.4.797
10.1007/BF00263740
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2004
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2004
DBID AAYXX
CITATION
DOI 10.1080/10170660409509403
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2151-7606
EndPage 229
ExternalDocumentID 10_1080_10170660409509403
9509403
GroupedDBID .7F
.QJ
0BK
4.4
AAGDL
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABXUL
ABXYU
ACTIO
ACTTO
ADCVX
ADGTB
AFBWG
AFION
AFRVT
AGDLA
AGMYJ
AGVKY
AGWUF
AIJEM
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
ALRRR
AQRUH
AQTUD
AVBZW
BLEHA
CCCUG
CE4
CYRSC
DAOYK
DGEBU
DKSSO
EBS
EJD
ESX
E~A
E~B
H13
KYCEM
M4Z
NA5
OPCYK
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TTHFI
TUROJ
TUS
UT5
UU3
ZGOLN
~S~
AAYXX
ABDBF
ACUHS
ADUMR
AGBKS
CITATION
HF~
I-F
IPNFZ
MK~
RIG
ID FETCH-LOGICAL-c261t-22a62e9056df84894cec27bf274c3e394792eed12b6f84c24a170c56e7c6edf53
ISSN 1017-0669
IngestDate Wed Oct 01 02:02:11 EDT 2025
Thu Apr 24 22:52:34 EDT 2025
Mon Oct 20 23:45:01 EDT 2025
Mon May 13 12:09:35 EDT 2019
IsPeerReviewed false
IsScholarly false
Issue 3
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c261t-22a62e9056df84894cec27bf274c3e394792eed12b6f84c24a170c56e7c6edf53
PageCount 10
ParticipantIDs crossref_primary_10_1080_10170660409509403
informaworld_taylorfrancis_310_1080_10170660409509403
crossref_citationtrail_10_1080_10170660409509403
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 1/1/2004
2004-01-00
PublicationDateYYYYMMDD 2004-01-01
PublicationDate_xml – month: 01
  year: 2004
  text: 1/1/2004
  day: 01
PublicationDecade 2000
PublicationTitle Journal of the Chinese Institute of Industrial Engineers
PublicationYear 2004
Publisher Taylor & Francis Group
Publisher_xml – name: Taylor & Francis Group
References Conway R. W. (CIT0004) 1976
CIT0003
CIT0002
CIT0005
CIT0007
Bruno J. L. (CIT0001) 1974; 74
CIT0006
CIT0008
References_xml – ident: CIT0007
  doi: 10.1016/S0377-2217(99)00386-0
– ident: CIT0003
  doi: 10.1137/0207001
– ident: CIT0006
  doi: 10.1016/S0305-0548(99)00083-0
– ident: CIT0008
  doi: 10.1137/0218022
– ident: CIT0005
  doi: 10.1287/opre.41.4.797
– volume: 74
  start-page: 504
  year: 1974
  ident: CIT0001
  publication-title: IFIPS Congress
– volume-title: Theory of scheduling
  year: 1976
  ident: CIT0004
– ident: CIT0002
  doi: 10.1007/BF00263740
SSID ssib016740505
ssib045028916
ssib007296312
ssib002258420
ssib054444800
ssib005906602
ssj0000329058
ssib029915108
ssib017350519
Score 1.3442708
Snippet We consider the problem of scheduling n jobs on m identical parallel machines. An optimal schedule to the proposed problem is defined as one that gives the...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 220
SubjectTerms empirical results
flowtime
heuristic algorithms
hierarchical criteria
makespan
Parallel machine scheduling
Title MAKESPAN MINIMIZATION ON IDENTICAL PARALLEL MACHINES SUBJECT TO MINIMUM TOTAL FLOW-TIME
URI https://www.tandfonline.com/doi/abs/10.1080/10170660409509403
Volume 21
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVLSH
  databaseName: aylor and Francis Online
  customDbUrl:
  mediaType: online
  eissn: 2151-7606
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib016740505
  issn: 1017-0669
  databaseCode: AHDZW
  dateStart: 19970101
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1db5swFLWy9GV7mPapZV_yw56GyIgxBh5RQ5d0gVQdUaq-ROAYadKUVh2Rqv6Q_t5dY0OcsVZbE4TAYCLbx9cnxvdchD6VggJrF8DcBBG21JSyc5_ldk7JWmqtkLLW0ktSNlnQ4zPvrNe7NVYtbatiyG_-6lfykFaFNGhX6SX7Hy3bPhQS4BjaF_bQwrD_pzZOom_x95MotZJpCkboXIXQgW06jtOsVjo4iU6j2SyeWUl0OJERNiwd4sTK5irbIoHDDG49ms2XdjZN4jsIq6SoMty2-CX21xgY4T8aecOWqX_dXlZ6OW4llRmvrHRojYctmi6a9cAbsE1t8un2x42d1YFDGi8c63i4N0NB_5ihyDrBQox5NWV15VAJ3EfZTlGnSSpi-8xhpqlWztQakq5pd4ljDOFETaJ0Rge1nHJUSwYxsF5hrR7o7obCdoGivvIIHRAYLZw-Oogm4_OlQXyAuBlE2wvlEw0PXQKGbUccpauHDBnYnvuuJ7lzcw6cAIq7U1minnwBvCPuHoVPoIUUa47hktDxlJ-nrrvmlX3gfOmUcI907UnyGmQqe4aealDhSEH6OeqJzQv0xNDGfImWDbixCW4MWwtu3IAbN-DGGtw4m2MNblyDG7fgfoUWR3F2OLF1FBCbw7_7yiYkZ0RAadm6DGgQUi448YuS-JS7wg2pHxIgeiNSMLjOCc2h8NxjwudMrEvPfY36m4uNeIPwiDoFPKH0C7egdC1y-HK39AOeE5kyQE5TTSuuJfJlpJafq5FW0u3U7AB9brNcKn2Y-252zLpfVXXPKFWn6N6-qq6rAfLuyeLe-VNvH5jvHXq868LvUb-62ooPQLur4qPuA78BbfCzag
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=MAKESPAN+MINIMIZATION+ON+IDENTICAL+PARALLEL+MACHINES+SUBJECT+TO+MINIMUM+TOTAL+FLOW-TIME&rft.jtitle=Journal+of+the+Chinese+Institute+of+Industrial+Engineers&rft.au=Gupta%2C+Jatinder+N.+D.&rft.au=Ho%2C+Johnny+C.&rft.au=Ruiz-Torres%2C+Alex+J.&rft.date=2004-01-01&rft.pub=Taylor+%26+Francis+Group&rft.issn=1017-0669&rft.eissn=2151-7606&rft.volume=21&rft.issue=3&rft.spage=220&rft.epage=229&rft_id=info:doi/10.1080%2F10170660409509403&rft.externalDocID=9509403
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1017-0669&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1017-0669&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1017-0669&client=summon