Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times

We compare several heuristics for solving a single machine scheduling problem. In the operating situation modelled, setup times are sequence-dependent and the objective is to minimize total tardiness. We describe an Ant Colony Optimization (ACO) algorithm having a new feature using look-ahead inform...

Full description

Saved in:
Bibliographic Details
Published inThe Journal of the Operational Research Society Vol. 53; no. 8; pp. 895 - 906
Main Authors Gagné, C, Price, W L, Gravel, M
Format Journal Article
LanguageEnglish
Published London Taylor & Francis 01.08.2002
Palgrave Macmillan Press
Palgrave Macmillan UK
Palgrave
Taylor & Francis Ltd
Subjects
Online AccessGet full text
ISSN0160-5682
1476-9360
DOI10.1057/palgrave.jors.2601390

Cover

Abstract We compare several heuristics for solving a single machine scheduling problem. In the operating situation modelled, setup times are sequence-dependent and the objective is to minimize total tardiness. We describe an Ant Colony Optimization (ACO) algorithm having a new feature using look-ahead information in the transition rule. This feature shows an improvement in performance. A comparison with a genetic algorithm, a simulated annealing approach, a local search method and a branch-and-bound algorithm indicates that the ACO that we describe is competitive and has a certain advantage for larger problems.
AbstractList We compare several heuristics for solving a single machine scheduling problem. In the operating situation modelled, setup times are sequence-dependent and the objective is to minimize total tardiness. We describe an Ant Colony Optimization (ACO) algorithm having a new feature using look-ahead information in the transition rule. This feature shows an improvement in performance. A comparison with a genetic algorithm, a simulated annealing approach, a local search method and a branch-and-bound algorithm indicates that the ACO that we describe is competitive and has a certain advantage for larger problems. Journal of the Operational Research Society.
Several heuristics for solving a single machine scheduling problem are compared. In the operating situation modeled, setup times are sequence-dependent and the objective is to minimize total tardiness. An Ant Colony Optimization (ACO) algorithm having a new feature using look-ahead information in the transition rule is described. This feature shows an improvement in performance. A comparison with a genetic algorithm, a simulated annealing approach, a local search method and a branch-and-bound algorithm indicates that the ACO that is described is competitive and has a certain advantage for larger problems.
We compare several heuristics for solving a single machine scheduling problem. In the operating situation modelled, setup times are sequence-dependent and the objective is to minimize total tardiness. We describe an Ant Colony Optimization (ACO) algorithm having a new feature using look-ahead information in the transition rule. This feature shows an improvement in performance. A comparison with a genetic algorithm, a simulated annealing approach, a local search method and a branch-and-bound algorithm indicates that the ACO that we describe is competitive and has a certain advantage for larger problems.
Author Price, W L
Gravel, M
Gagné, C
Author_xml – sequence: 1
  givenname: C
  surname: Gagné
  fullname: Gagné, C
  organization: Université du Québec, Chicoutimi
– sequence: 2
  givenname: W L
  surname: Price
  fullname: Price, W L
  email: wilson.price@fsa.ulaval.ca
  organization: Université Laval
– sequence: 3
  givenname: M
  surname: Gravel
  fullname: Gravel, M
  organization: Université du Québec, Chicoutimi
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=13771537$$DView record in Pascal Francis
BookMark eNqFkstq3DAUhk1JoZO0T1AKotDuPNXFli26aRh6g0A27VrI8nGsQZZcSW7Ips9eGU9SyKLZSOjo_85Fv86LM-cdFMUbgvcE182HWdmboH7D_uhD3FOOCRP4WbEjVcNLwTg-K3aYcFzWvKUvivMYjxhjgYnYFX8OfppVMO4GKYcuD9coJ_PBpHFCt3lFPo0Q0AhLMDEZHdHgA8oxFDNjAU1Kj8blox6hX-yaaA6-s3DiI_xawGkoe5jB9eBSDqVlRslMEF8WzwdlI7w67RfFzy-ffxy-lVfXX78fLq9KXXGWSi24ILwjQres7SkeiB6aoSZiqDhtW1F1qu4V1oyxviEUUxh4y7TqGtAUuopdFO-3vLm33E9McjJRg7XKgV-ipA3mNaE0C98-Eh79ElzuTVJGaF1RsWZ7dxKpqJUdgnLaRDkHM6lwJwlrGlKzJus-bjodfIwBBqlNUsl4l4IyVhIsVwPlvYFyNVCeDMx0_Yh-KPAExzcuzquvEP6N8BT4egOPMfnwUK2lVJB1mE_brXH5C0zq1gfby6TurA_3L8D-X-Av2XnbiQ
CODEN JORSDZ
CitedBy_id crossref_primary_10_1016_j_ejor_2006_06_060
crossref_primary_10_1007_s10732_017_9325_1
crossref_primary_10_1080_09511920500064755
crossref_primary_10_1504_IJCAT_2011_038552
crossref_primary_10_1016_j_asoc_2008_04_013
crossref_primary_10_1007_s10951_013_0351_z
crossref_primary_10_1016_j_engappai_2010_01_008
crossref_primary_10_1007_s10064_020_01936_2
crossref_primary_10_1016_j_procir_2014_05_007
crossref_primary_10_1016_j_asoc_2015_07_050
crossref_primary_10_1080_00207540500536939
crossref_primary_10_1016_j_cor_2005_07_020
crossref_primary_10_1016_j_swevo_2021_100869
crossref_primary_10_3233_IDT_160278
crossref_primary_10_1016_j_enggeo_2009_06_010
crossref_primary_10_1016_j_cor_2012_07_004
crossref_primary_10_1080_00207540600990432
crossref_primary_10_1007_s10589_010_9333_7
crossref_primary_10_1002_col_22363
crossref_primary_10_1007_s12354_011_0136_2
crossref_primary_10_1007_s10732_006_6662_x
crossref_primary_10_1007_s00170_006_0492_8
crossref_primary_10_1016_j_solener_2016_11_034
crossref_primary_10_1007_s10845_009_0253_2
crossref_primary_10_1016_j_cor_2011_08_022
crossref_primary_10_1080_00207543_2014_883472
crossref_primary_10_1007_s10951_012_0280_2
crossref_primary_10_1016_j_tcs_2012_01_043
crossref_primary_10_1016_j_engappai_2012_03_011
crossref_primary_10_1016_j_ymssp_2017_04_046
crossref_primary_10_4018_jsita_2012100101
crossref_primary_10_1016_j_asoc_2018_06_051
crossref_primary_10_1016_j_tcs_2005_05_020
crossref_primary_10_1016_j_cie_2020_106797
crossref_primary_10_1016_j_rimni_2013_06_006
crossref_primary_10_1080_00207543_2012_676683
crossref_primary_10_1080_0305215X_2013_786062
crossref_primary_10_1016_j_ejor_2005_05_018
crossref_primary_10_1016_j_plrev_2005_10_001
crossref_primary_10_1016_j_tre_2011_02_005
crossref_primary_10_1007_s10898_011_9793_z
crossref_primary_10_1109_TMAG_2006_871425
crossref_primary_10_1007_s11590_019_01525_7
crossref_primary_10_1016_j_asoc_2012_05_017
crossref_primary_10_1007_s10489_011_0322_z
crossref_primary_10_1016_j_cor_2011_12_017
crossref_primary_10_1109_TMAG_2005_845998
crossref_primary_10_1016_j_eswa_2008_08_033
crossref_primary_10_1134_S1990478924020029
crossref_primary_10_1007_s00170_006_0693_1
crossref_primary_10_1016_j_cor_2016_10_008
crossref_primary_10_4236_ajor_2014_43015
crossref_primary_10_1007_s10951_017_0549_6
crossref_primary_10_1080_00207543_2019_1581383
crossref_primary_10_1515_jisys_2016_0019
crossref_primary_10_1016_j_cor_2008_06_007
crossref_primary_10_1007_s00170_015_7350_5
crossref_primary_10_1007_s00170_012_4465_9
crossref_primary_10_1108_13552511011084535
crossref_primary_10_1016_j_engappai_2024_108572
crossref_primary_10_1109_TMAG_2013_2242860
crossref_primary_10_1007_s11590_019_01440_x
crossref_primary_10_1016_j_cor_2006_07_003
crossref_primary_10_1016_j_neucom_2022_01_032
crossref_primary_10_1155_2016_9598041
crossref_primary_10_1016_j_cie_2015_12_012
crossref_primary_10_4236_jbcpr_2015_34022
crossref_primary_10_1016_j_ejor_2006_06_046
crossref_primary_10_1631_jzus_2005_A1040
crossref_primary_10_1016_j_cor_2011_05_011
crossref_primary_10_1007_s11390_023_2007_6
crossref_primary_10_3182_20050703_6_CZ_1902_01518
crossref_primary_10_1007_s00500_018_3014_3
crossref_primary_10_1016_j_ijpe_2005_01_008
crossref_primary_10_1007_s00170_008_1544_z
crossref_primary_10_1057_jors_2014_88
crossref_primary_10_1016_j_cor_2014_04_009
crossref_primary_10_1155_2015_687968
crossref_primary_10_4028_www_scientific_net_AMM_411_414_2081
crossref_primary_10_1057_jors_2009_182
crossref_primary_10_1057_palgrave_jors_2602361
crossref_primary_10_1016_j_cor_2024_106804
crossref_primary_10_1007_s00170_014_6510_3
crossref_primary_10_1007_s10951_015_0429_x
crossref_primary_10_1016_j_cie_2008_11_022
crossref_primary_10_1057_palgrave_jors_2602434
crossref_primary_10_1016_j_camwa_2010_12_028
crossref_primary_10_1080_02522667_2015_1026460
crossref_primary_10_1016_S1672_6529_13_60219_X
crossref_primary_10_1057_palgrave_jors_2601868
ContentType Journal Article
Copyright Copyright © 2002, Palgrave Macmillan Ltd 2002
Copyright 2002 Operational Research Society Ltd
Palgrave Macmillan Ltd 2002
2002 INIST-CNRS
Copyright (c) 2002 Palgrave Macmillan Ltd
Copyright_xml – notice: Copyright © 2002, Palgrave Macmillan Ltd 2002
– notice: Copyright 2002 Operational Research Society Ltd
– notice: Palgrave Macmillan Ltd 2002
– notice: 2002 INIST-CNRS
– notice: Copyright (c) 2002 Palgrave Macmillan Ltd
DBID AAYXX
CITATION
IQODW
3V.
7RQ
7WY
7WZ
7X7
7XB
87Z
88E
8AL
8FE
8FG
8FI
8FJ
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
FYUFA
F~G
GHDGH
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
K9.
L.-
L6V
M0C
M0N
M0S
M1P
M2O
M7S
MBDVC
P5Z
P62
PHGZM
PHGZT
PJZUB
PKEHL
PPXIY
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
U9A
7SC
8FD
L7M
L~C
L~D
DOI 10.1057/palgrave.jors.2601390
DatabaseName CrossRef
Pascal-Francis
ProQuest Central (Corporate)
Career & Technical Education Database
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
Health & Medical Collection
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Medical Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest SciTech Collection
ProQuest Technology Collection
Hospital Premium Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Research Library
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
Technology Collection
ProQuest One Community College
ProQuest Central Korea
Business Premium Collection (Alumni)
Health Research Premium Collection
ABI/INFORM Global (Corporate)
Health Research Premium Collection (Alumni)
ProQuest Central Student
Research Library Prep
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ProQuest Health & Medical Complete (Alumni)
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ABI/INFORM Global
Computing Database
Health & Medical Collection (Alumni Edition)
PML(ProQuest Medical Library)
Research Library
Engineering Database
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
ProQuest One Health & Nursing
ProQuest One Business (OCUL)
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
Computer and Information Systems Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest One Applied & Life Sciences
Health Research Premium Collection
Health & Medical Research Collection
ProQuest Central (New)
ProQuest Medical Library (Alumni)
Engineering Collection
Career and Technical Education (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Hospital Collection
ProQuest Technology Collection
Health Research Premium Collection (Alumni)
ProQuest Business Collection
ProQuest Hospital Collection (Alumni)
ProQuest Career and Technical Education
ProQuest Health & Medical Complete
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Health & Medical Complete (Alumni)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest One Health & Nursing
Research Library (Alumni Edition)
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Health & Medical Research Collection
ProQuest Engineering Collection
Health and Medicine Complete (Alumni Edition)
ProQuest Central Korea
ProQuest Research Library
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest Medical Library
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
ProQuest Business Collection (Alumni Edition)



Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
Computer Science
Business
Applied Sciences
EISSN 1476-9360
EndPage 906
ExternalDocumentID 141892341
13771537
10_1057_palgrave_jors_2601390
822917
11942064
Genre Research Article
Feature
GroupedDBID -~X
.DC
0BK
0R~
1OL
29L
30N
3EH
3R3
4.4
5GY
7RQ
7WY
7X7
88E
8FE
8FG
8FI
8FJ
8FL
8G5
8R4
8R5
AAAZS
AAGDL
AAHIA
AAIAL
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
AAXLS
ABAWQ
ABBHK
ABDPE
ABJCF
ABJNI
ABKVW
ABLIJ
ABLJU
ABLWH
ABPAQ
ABPPZ
ABUWG
ABXSQ
ABXUL
ABXYU
ABYYQ
ACGFO
ACHJO
ACHQT
ACIWK
ACNCT
ACREN
ACTIO
ACTTO
ACXJH
ADBBV
ADEPB
ADFRT
ADGDI
ADGTB
ADMHG
ADNFJ
ADULT
AEBJH
AECXW
AEISY
AENEX
AEUPB
AEXYK
AEYOC
AFAIT
AFBWG
AFKRA
AFRVT
AFTQD
AGAYW
AGDLA
AGKTX
AGVKY
AGWUF
AHAJD
AHDZW
AHSBF
AI.
AIYEW
AJRNO
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
ALRRR
AMKLP
AMTXH
APTMU
AQRUH
AQTUD
ARAPS
ASMEE
ASPBG
AVWKF
AWYRJ
AXYYD
AZQEC
BENPR
BEZIV
BGLVJ
BKKNO
BLEHA
BPHCQ
BVXVI
CAG
CBXGM
CCCUG
CCKSF
CCPQU
COF
CS3
CYRSC
CYVLN
DAOYK
DGEBU
DU5
DWQXO
EBS
EJD
F5P
FEFRA
FRNLG
FYUFA
GENNL
GNUQQ
GROUPED_ABI_INFORM_RESEARCH
GUPYA
GUQSH
HCIFZ
HMCUK
HVGLF
IPSME
JAAYA
JAV
JBC
JBMMH
JBZCM
JENOY
JHFFW
JKQEH
JLEZI
JLXEF
JPL
JPPEU
JST
K60
K6V
K6~
K7-
KYCEM
L6V
M0C
M1P
M2O
M4Z
M7S
MS~
N8N
O9-
P2P
P62
PHGZM
PHGZT
PJZUB
PLIJB
PPXIY
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PSQYO
PTHSS
Q2X
RNANH
RNS
ROSJB
RPC
RSV
RTWRZ
SA0
SOJ
TAJZE
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TN5
TTHFI
TUROJ
U5U
UKHRP
VH1
WH7
XSW
ZGOLN
~02
AAYOK
AAYZH
ADYSH
ALIPV
AMPGV
3V.
AJPNJ
AQSKT
CSNOR
GROUPED_ABI_INFORM_COMPLETE
JSODD
M0N
PKN
SNX
VQA
AARHV
AAYXX
ABMNI
ADMLS
ADUMR
ADXEU
AEHZU
AEZBV
AFFNX
AGBKS
AGYFW
AKHJE
AKMBP
BGSSV
CITATION
HGD
H~9
IFELN
LJTGL
NHB
NUSFT
PUEGO
ZCG
IQODW
7XB
8AL
8FK
JQ2
K9.
L.-
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
U9A
7SC
8FD
L7M
L~C
L~D
ID FETCH-LOGICAL-c463t-c96916b19c838d20f1cf7f519f4628894ba5da0c333d71202ef683cab7ec2eb43
IEDL.DBID BENPR
ISSN 0160-5682
IngestDate Thu Sep 04 16:58:59 EDT 2025
Mon Oct 06 17:01:44 EDT 2025
Mon Jul 21 09:15:01 EDT 2025
Wed Oct 01 04:12:09 EDT 2025
Thu Apr 24 23:05:31 EDT 2025
Fri Feb 21 02:44:27 EST 2025
Thu Jun 19 15:19:56 EDT 2025
Mon Oct 20 23:37:14 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 8
Keywords scheduling
metaheuristic
sequence-dependent setups
ant colony optimization
total tardiness
single machine
Setup time
Scheduling
Single machine
NP hard problem
Language English
License http://www.springer.com/tdm
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c463t-c96916b19c838d20f1cf7f519f4628894ba5da0c333d71202ef683cab7ec2eb43
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 231254294
PQPubID 31386
PageCount 12
ParticipantIDs proquest_journals_231254294
proquest_miscellaneous_27065122
crossref_citationtrail_10_1057_palgrave_jors_2601390
jstor_primary_822917
pascalfrancis_primary_13771537
informaworld_taylorfrancis_310_1057_palgrave_jors_2601390
springer_journals_10_1057_palgrave_jors_2601390
crossref_primary_10_1057_palgrave_jors_2601390
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2002-08-01
PublicationDateYYYYMMDD 2002-08-01
PublicationDate_xml – month: 08
  year: 2002
  text: 2002-08-01
  day: 01
PublicationDecade 2000
PublicationPlace London
PublicationPlace_xml – name: London
– name: Basingstoke
– name: Abingdon
PublicationTitle The Journal of the Operational Research Society
PublicationTitleAbbrev J Oper Res Soc
PublicationYear 2002
Publisher Taylor & Francis
Palgrave Macmillan Press
Palgrave Macmillan UK
Palgrave
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Palgrave Macmillan Press
– name: Palgrave Macmillan UK
– name: Palgrave
– name: Taylor & Francis Ltd
SSID ssj0009019
Score 2.0438163
Snippet We compare several heuristics for solving a single machine scheduling problem. In the operating situation modelled, setup times are sequence-dependent and the...
Several heuristics for solving a single machine scheduling problem are compared. In the operating situation modeled, setup times are sequence-dependent and the...
SourceID proquest
pascalfrancis
crossref
springer
jstor
informaworld
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 895
SubjectTerms Algorithms
ant colony optimization
Ants
Applied sciences
Business and Management
Exact sciences and technology
Genetic algorithms
Heuristic
Heuristics
Insect colonies
Insect genetics
Job shops
Lateness
Management
metaheuristic
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimization
Pheromones
Scheduling
Scheduling, sequencing
sequence-dependent setups
single machine
Studies
Theoretical Paper
Theoretical Papers
total tardiness
Title Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
URI https://www.tandfonline.com/doi/abs/10.1057/palgrave.jors.2601390
https://www.jstor.org/stable/822917
https://link.springer.com/article/10.1057/palgrave.jors.2601390
https://www.proquest.com/docview/231254294
https://www.proquest.com/docview/27065122
Volume 53
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVLSH
  databaseName: aylor and Francis Online
  customDbUrl:
  mediaType: online
  eissn: 1476-9360
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009019
  issn: 0160-5682
  databaseCode: AHDZW
  dateStart: 19970101
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVPQU
  databaseName: Health & Medical Collection
  customDbUrl:
  eissn: 1476-9360
  dateEnd: 20171231
  omitProxy: true
  ssIdentifier: ssj0009019
  issn: 0160-5682
  databaseCode: 7X7
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/healthcomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 1476-9360
  dateEnd: 20171231
  omitProxy: true
  ssIdentifier: ssj0009019
  issn: 0160-5682
  databaseCode: BENPR
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Technology Collection
  customDbUrl:
  eissn: 1476-9360
  dateEnd: 20171231
  omitProxy: true
  ssIdentifier: ssj0009019
  issn: 0160-5682
  databaseCode: 8FG
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/technologycollection1
  providerName: ProQuest
– providerCode: PRVAWR
  databaseName: Taylor & Francis Science and Technology Library-DRAA
  customDbUrl:
  eissn: 1476-9360
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009019
  issn: 0160-5682
  databaseCode: 30N
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://www.tandfonline.com/page/title-lists
  providerName: Taylor & Francis
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwhV3db9MwED9trYTgYbCOiW5Q_MADPKRN7CROHhAqZaVC2kCIiYqXyPnwJrSlZU1f-du5c-1-8LC9RIqTi5P4fD757n4_gDexTiWBfHip8LWH_n-JU6oMvCDRiuI0CRdUO3x-EU8uwy_TaLoH564WhtIqnU00hrqcFbRHPkA_hBO3Uvhh_scj0igKrjoGDWWZFcr3BmFsH9qcgLFa0P54dvHt-waF1zdMH4Sq5kVxwl1JTyQHjui2_3t2t-gT0JYgO721WO1Ambr0RcqlVAv8nXrFg7HjqP4XWzVL1vgZHFhfkw1XynEIe1XdgUcu1b0DTx2lA7MzvANPtvAJO3Bo2xfsrYWnfncEf0cr6sL6iqmaDUdfGX4T_qrm-pbRri4zNV3sulpaEGiG38OwjdG2xE3Fbk3-Jp6ivpSUCH_FLK3NSt5ld3uOoLfBpmY5Zw2VqzyHy_HZj9HEsywOXhHGovGKNEYXNA_SIhFJyX0dFFpqdBw1lcUmaZirqFR-IYQoZcB9Xuk4EYXKZVXwKg_FMbTqWV29AJZzpfKwirRUPEy0RtusdVGqXMkg9yPdhdANV1ZYiHNi2rjJTKg9kpkb5YxGObOj3IX-Wmy-wvh4SCDd1oWsMZsrVgMy8YDskVGcdU-EuB_ILvR29GjzIkJKXJXwhlOnWJk1M_hMNym68Hp9Fe0DBX1UXc2WeAvFsQPOuzBw2riRv_dNT-7t8RQeG2Ickwv5ElrN3bJ6hf5Zk_dgX04lHpPx5x60h5NPv3727Ez8Bzk0Q4Y
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwEB6VVuJxALoFsRRaH0CCQ3YTO4mTQ4XK0mpL2wWhVuotOIndCrXZpZsV4sI_478xk7X3waE99Rgnk4dmPJ54Zr4P4E1sUkkgH14qfONh_F_ilCoDL0iMojxNwgX1Dh8P4v5p-PksOluBv64XhsoqnU9sHHU5LGiPvItxCCdupfDD6KdHpFGUXHUMGsoyK5Q7DcKY7es41L9_4R_ceOfgE6r7Lef7eye9vmdJBrwijEXtFWmMEVIepEUikpL7JiiMNBjXGOraTNIwV1Gp_EIIUcqA-1ybOBGFyqUuuM5Dgfe9B2uhCFP891v7uDf4-m2O-us3zCKE4uZFccJdC1Eku45Yt_NjeD3uELCXoHVhYXFcgk515ZJUu6nGqD4z5d1YCoz_y-U2S-T-U3hsY1u2OzXGdVjRVQvuu9L6FjxxFBLMepQWPFrAQ2zBuh0fs3cWDvv9BvzpTakSq3OmKrbb-8Lwm1A19cUVo11k1vSQsQs9saDTDL-H4RijbZBLza6aelE8RPssqfD-nFkanam8qyb3HCFwjUP1ZMRqao95Bqd3otDnsFoNK_0CWM6VykMdGal4mBiDa4ExRalyJYPcj0wbQqeurLCQ6sTscZk1qf1IZk7LGWk5s1puQ2cmNppiitwmkC7aQlY3mznWAjJxi-xGYzizJxHCfyDbsLVkR_MXEVLiKogXbDrDyqxbw3u6SdiG7dlZ9EeUZFKVHk7wEsqbB5y3oeuscS5_45u-vPGJ2_Cgf3J8lB0dDA434WFDytPUYb6C1fp6ol9jbFjnW3YGMvh-15P-H40GfOY
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwEB6VIlVwKHRLxbbQ-gASHLKb2EmcHBCqtqxaCoUDlfYWnIdboTa7dLNCXPhf_DtmHHsfHNpTj3EyeWhm7Iln5vsAXsU6lQTy4aXC1x7G_yW6VBl4QaIV5WkSLqh3-PNZfHwefhxFozX463phqKzSzYlmoi7HBe2R9zEO4cStFPa1rYr4ejR8P_npEYEUJVodm0ZrIafV71_49zZ9d3KEqn7N-fDDt8GxZwkGvCKMReMVaYzRUR6kRSKSkvs6KLTUGNNo6thM0jBXUan8QghRyoD7vNJxIgqVy6rgVR4KvO8DeCiFSKmaUI7kAu_XN5wihN_mRXHCXfNQJPuOUrf3Y3wz7RGkl6AVYWlZXAFNdYWSVLWppqg43TJurITE_2VxzeI4fAqbNqplh60ZbsFaVXdgwxXVd-CJI49gdi7pwOMlJMQObNnxKXtjgbDfbsOfQUuSWF8wVbPDwReG34SKaC6vGe0fM9M9xi6rmYWbZvg9DMcYbYBcVezaVIriIVpmSSX3F8wS6LTyro7cc1TADQ41swlrqDHmGZzfizp3YL0e19VzYDlXKg-rSEvFw0RrXAW0LkqVKxnkfqS7EDp1ZYUFUydOj6vMJPUjmTktZ6TlzGq5C7252KRFE7lLIF22hawx2zjWAjJxh-y2MZz5kwjbP5Bd2F-xo8WLCClx_cML9pxhZXZCw3s69-vCwfwszkSUXlJ1NZ7hJZQxDzjvQt9Z40L-1jfdvfWJB7CBrp59Ojk73YNHho3HFGC-gPXmZla9xKCwyfeN-zH4ft_-_g89HXqA
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=Comparing+an+ACO+algorithm+with+other+heuristics+for+the+single+machine+scheduling+problem+with+sequence-dependent+setup+times&rft.jtitle=The+Journal+of+the+Operational+Research+Society&rft.au=Gagne%2C+C&rft.au=Gravel%2C+M&rft.au=Price%2C+Wilson+L&rft.date=2002-08-01&rft.issn=0160-5682&rft.volume=53&rft.issue=8&rft.spage=895&rft.epage=906&rft_id=info:doi/10.1057%2Fpalgrave.jors.2601390&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0160-5682&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0160-5682&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0160-5682&client=summon