Multicriteria scheduling

In this paper we give a survey of the most important results on multicriteria scheduling that have appeared in the literature or are to appear. We provide an extensive introduction including two example problems and then discuss the relevant literature. Here we pay special attention to the area of e...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 167; no. 3; pp. 592 - 623
Main Author Hoogeveen, Han
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 16.12.2005
Elsevier
SeriesEuropean Journal of Operational Research
Subjects
Applied sciences
Controllable processing times
Earliness-tardiness
Exact sciences and technology
Machine scheduling
Multicriteria
Operational research and scientific management
Operational research. Management science
Pareto optimal
Scheduling, sequencing
Simultaneous approximation
Simultaneous approximation
Machine scheduling
Pareto optimal
Earliness-tardiness
Controllable processing times
Multicriteria
Pareto optimum
Multicriteria analysis
Parallel machines
Processing time
Scheduling
Controllability
Earliness
Simultaneity
Online AccessGet full text

Cover

Abstract In this paper we give a survey of the most important results on multicriteria scheduling that have appeared in the literature or are to appear. We provide an extensive introduction including two example problems and then discuss the relevant literature. Here we pay special attention to the area of earliness-tardiness scheduling, scheduling with controllable processing times, simultaneous approximation, and new models.
AbstractList In this paper we give a survey of the most important results on multicriteria scheduling that have appeared in the literature or are to appear. We provide an extensive introduction including two example problems and then discuss the relevant literature. Here we pay special attention to the area of earliness-tardiness scheduling, scheduling with controllable processing times, simultaneous approximation, and new models.
Author Hoogeveen, Han
Author_xml – sequence: 1
  givenname: Han
  surname: Hoogeveen
  fullname: Hoogeveen, Han
  email: slam@cs.uu.nl
  organization: Department of Computer Science, Utrecht University, P.O. Box 80089, Utrecht 3508 TB, The Netherlands
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17035464$$DView record in Pascal Francis
http://econpapers.repec.org/article/eeeejores/v_3a167_3ay_3a2005_3ai_3a3_3ap_3a592-623.htm$$DView record in RePEc
BookMark eNp9UD1PwzAUtFCRaAs7YmJhTPCzYzuVWFDFlyhigdly7BfqKE0jO63Uf4-rINh40r233J3u3oxMum2HhFwBzYGCvG1ybLYhZ5QWOVU5BTghUygVy2Qp6YRMKVcqYwzUGZnF2FBKQYCYksu3XTt4G_yAwZvraNfodq3vvs7JaW3aiBc_d04-Hx8-ls_Z6v3pZXm_ymwh2JAJjs5xZkVVGnBVbblwpaxqhQKtcM4YXlYSQKUtqAMDbKFK4FZIg-WC8Tlho68N2xgD1roPfmPCQQPVx2660cdu-thNU6VTtyR6HUUBe7S_CkyTqBj1XnMDUqV9SEhSkY5P4Al9glgwLRnX62GT3G5Gt95Ea9o6mM76-JdDUS4KWSTe3cjD9I-9x6Cj9dhZdD6gHbTb-v9CfwPl_38u
CODEN EJORDT
CitedBy_id crossref_primary_10_1016_j_cie_2008_02_005
crossref_primary_10_1007_s12351_023_00799_1
crossref_primary_10_1007_s10951_007_0048_2
crossref_primary_10_1016_j_cor_2008_11_016
crossref_primary_10_1016_j_engappai_2010_01_008
crossref_primary_10_1016_j_tcs_2014_12_020
crossref_primary_10_1007_s10288_013_0244_1
crossref_primary_10_3182_20120523_3_RO_2023_00293
crossref_primary_10_1108_03056121211222291
crossref_primary_10_1287_ijoc_1070_0258
crossref_primary_10_1080_07408170701781951
crossref_primary_10_1007_s10878_016_9994_y
crossref_primary_10_1016_j_cie_2013_02_018
crossref_primary_10_1155_2020_4597827
crossref_primary_10_4028_www_scientific_net_AMR_367_653
crossref_primary_10_1142_S0217595914500250
crossref_primary_10_1007_s00170_010_2921_y
crossref_primary_10_1016_j_future_2016_09_004
crossref_primary_10_1016_j_ejor_2008_10_038
crossref_primary_10_1016_j_datak_2008_04_010
crossref_primary_10_1007_s10257_020_00470_8
crossref_primary_10_4236_jamp_2024_122043
crossref_primary_10_1080_00207543_2013_825740
crossref_primary_10_1007_s10479_023_05780_x
crossref_primary_10_1016_j_ijpe_2012_05_016
crossref_primary_10_1016_j_tcs_2010_12_007
crossref_primary_10_1134_S1064226921130064
crossref_primary_10_1080_00207540903491799
crossref_primary_10_1007_s10951_011_0252_y
crossref_primary_10_1016_j_asoc_2016_07_004
crossref_primary_10_1016_j_ejor_2014_03_026
crossref_primary_10_1007_s00170_006_0674_4
crossref_primary_10_1016_j_ejor_2013_09_033
crossref_primary_10_1080_00207540903433874
crossref_primary_10_1051_ro_2017089
crossref_primary_10_1142_S0217595921500238
crossref_primary_10_1016_j_ejor_2005_11_029
crossref_primary_10_1007_s00170_010_2978_7
crossref_primary_10_1007_s00170_012_4215_z
crossref_primary_10_1142_S0217595917400140
crossref_primary_10_1007_s00170_008_1885_7
crossref_primary_10_1007_s10479_011_0894_3
crossref_primary_10_1007_s10951_017_0551_z
crossref_primary_10_1109_ACCESS_2019_2929582
crossref_primary_10_1007_s00500_010_0673_0
crossref_primary_10_1007_s10951_023_00781_x
crossref_primary_10_1080_00207540701487833
crossref_primary_10_1080_0951192X_2015_1030696
crossref_primary_10_1016_j_ejor_2006_10_024
crossref_primary_10_1007_s40305_020_00334_5
crossref_primary_10_1016_j_apm_2017_05_016
crossref_primary_10_1016_j_amc_2018_03_001
crossref_primary_10_1007_s10951_012_0303_z
crossref_primary_10_1016_j_cor_2015_06_010
crossref_primary_10_1155_2015_907034
crossref_primary_10_1051_ro_2017074
crossref_primary_10_1016_j_ejor_2006_05_050
crossref_primary_10_1016_j_ijpe_2013_10_011
crossref_primary_10_1016_j_ejor_2006_05_052
crossref_primary_10_3934_era_2023154
crossref_primary_10_1007_s10951_018_0588_7
crossref_primary_10_1016_j_ejor_2020_12_006
crossref_primary_10_1016_j_cor_2006_07_013
crossref_primary_10_1287_ijoc_1050_0167
crossref_primary_10_1109_TEM_2011_2171055
crossref_primary_10_1002_nav_21582
crossref_primary_10_3390_app11062783
crossref_primary_10_1007_s00170_011_3650_6
crossref_primary_10_1007_s00500_015_1987_8
crossref_primary_10_1016_j_jclepro_2013_12_024
crossref_primary_10_1016_j_cor_2009_06_025
crossref_primary_10_1057_jors_2012_94
crossref_primary_10_1016_j_cor_2018_07_004
crossref_primary_10_1016_j_ipl_2009_02_007
crossref_primary_10_1080_17509653_2011_10671153
crossref_primary_10_1016_j_ejor_2012_07_013
crossref_primary_10_3390_math11244883
crossref_primary_10_1016_j_cie_2022_108288
crossref_primary_10_1142_S0217595909002225
crossref_primary_10_1016_j_orl_2012_05_006
crossref_primary_10_1007_s10951_007_0011_2
crossref_primary_10_1016_j_cor_2005_10_018
crossref_primary_10_1109_JSYST_2022_3213767
crossref_primary_10_1016_j_ejor_2018_11_002
crossref_primary_10_1080_0305215X_2016_1190353
crossref_primary_10_1007_s10288_015_0299_2
crossref_primary_10_1007_s40305_015_0083_1
crossref_primary_10_1057_palgrave_jors_2602610
crossref_primary_10_3934_jimo_2014_10_219
crossref_primary_10_1016_j_ejor_2013_09_017
crossref_primary_10_1080_00207543_2014_970705
crossref_primary_10_1016_j_disopt_2022_100698
crossref_primary_10_1007_s10878_020_00626_9
crossref_primary_10_1057_jors_2013_43
crossref_primary_10_1016_j_cie_2022_107969
crossref_primary_10_1007_s00170_010_3100_x
crossref_primary_10_7763_IJMLC_2015_V5_479
crossref_primary_10_1016_j_compchemeng_2018_08_020
crossref_primary_10_1016_j_ejor_2020_10_052
crossref_primary_10_1007_s10951_007_0033_9
crossref_primary_10_1007_s10723_012_9210_y
crossref_primary_10_1080_00207540701450013
crossref_primary_10_3390_app13021094
crossref_primary_10_1007_s00170_008_1770_4
crossref_primary_10_1007_s10732_018_9378_9
crossref_primary_10_1016_j_ipl_2015_07_002
crossref_primary_10_30526_37_1_3094
crossref_primary_10_1016_j_mcm_2011_01_032
crossref_primary_10_17341_gazimmfd_573734
crossref_primary_10_1016_j_ejor_2006_03_025
crossref_primary_10_1016_j_ejor_2015_05_057
crossref_primary_10_1007_s10878_019_00507_w
crossref_primary_10_1016_j_cie_2009_12_009
crossref_primary_10_2139_ssrn_4166611
crossref_primary_10_1007_s10845_009_0318_2
crossref_primary_10_1016_j_apm_2011_07_084
crossref_primary_10_1016_j_ejor_2021_11_023
crossref_primary_10_1002_nav_22103
crossref_primary_10_1007_s10951_011_0256_7
crossref_primary_10_1016_j_mcm_2007_08_018
crossref_primary_10_1016_j_cor_2016_06_008
crossref_primary_10_1007_s00291_010_0219_y
crossref_primary_10_1016_j_ejor_2022_06_021
crossref_primary_10_1016_j_jairtraman_2019_101734
crossref_primary_10_1016_j_ejor_2016_05_047
crossref_primary_10_1142_S179383090900018X
crossref_primary_10_1007_s00170_011_3317_3
crossref_primary_10_1016_j_dam_2011_04_001
crossref_primary_10_1016_j_jom_2010_12_006
crossref_primary_10_1007_s10732_014_9249_y
crossref_primary_10_1016_j_tcs_2010_02_006
crossref_primary_10_1016_j_cor_2009_03_021
crossref_primary_10_1007_s10845_008_0191_4
crossref_primary_10_1016_j_camwa_2010_09_046
crossref_primary_10_1016_j_ejor_2014_09_043
crossref_primary_10_1007_s10878_015_9918_2
crossref_primary_10_1016_j_orl_2006_01_007
crossref_primary_10_1016_j_jmsy_2020_09_004
crossref_primary_10_1007_s10951_023_00779_5
crossref_primary_10_2139_ssrn_3666676
crossref_primary_10_1007_s10100_011_0220_9
crossref_primary_10_1016_j_ijpe_2019_107542
crossref_primary_10_1057_jors_2008_191
crossref_primary_10_1016_j_disopt_2015_02_001
crossref_primary_10_3934_jimo_2016060
crossref_primary_10_1016_j_ejor_2019_07_072
crossref_primary_10_1016_j_cie_2021_107525
crossref_primary_10_14778_1453856_1453960
crossref_primary_10_1016_j_cor_2019_04_017
crossref_primary_10_1080_00207543_2011_578162
crossref_primary_10_1016_j_ejor_2014_12_012
crossref_primary_10_1051_ro_2024020
crossref_primary_10_1080_0305215X_2017_1414207
crossref_primary_10_1007_s10845_009_0370_y
crossref_primary_10_1109_TAC_2007_910668
crossref_primary_10_1016_j_amc_2019_124697
crossref_primary_10_1016_j_cie_2011_08_019
crossref_primary_10_2139_ssrn_1974492
crossref_primary_10_1016_j_ejor_2009_02_014
crossref_primary_10_1016_j_ejor_2014_09_063
crossref_primary_10_1142_S021759591000296X
crossref_primary_10_37394_23209_2020_17_a025103_920
crossref_primary_10_3390_joitmc6020029
crossref_primary_10_1016_j_cor_2011_08_009
crossref_primary_10_1016_j_dam_2007_02_003
crossref_primary_10_1051_ro_2023067
crossref_primary_10_1016_j_eswa_2010_10_066
crossref_primary_10_1007_s10951_009_0120_1
crossref_primary_10_1007_s10951_023_00795_5
crossref_primary_10_1016_j_amc_2015_10_059
crossref_primary_10_1016_j_dam_2022_08_001
crossref_primary_10_1016_j_cor_2021_105523
crossref_primary_10_1080_0951192X_2015_1099074
crossref_primary_10_1109_ACCESS_2018_2879600
crossref_primary_10_1016_j_eswa_2018_11_007
crossref_primary_10_1016_j_ejor_2022_11_014
crossref_primary_10_1080_00207543_2012_663945
crossref_primary_10_3934_jimo_2016_12_1465
crossref_primary_10_1051_ro_2021175
crossref_primary_10_1016_j_jmsy_2015_08_002
crossref_primary_10_1016_j_tcs_2007_04_034
crossref_primary_10_4018_jaec_2012040103
crossref_primary_10_1016_j_tcs_2013_05_034
crossref_primary_10_1007_s00170_010_3094_4
crossref_primary_10_1007_s10951_014_0410_0
crossref_primary_10_1007_s11590_020_01576_1
crossref_primary_10_3934_mbe_2022346
crossref_primary_10_1016_j_cor_2013_02_016
crossref_primary_10_1080_00207543_2020_1845914
crossref_primary_10_1051_ro_2023003
crossref_primary_10_1080_02522667_2008_10699819
crossref_primary_10_1016_j_cor_2018_09_005
crossref_primary_10_1021_ie101404b
crossref_primary_10_1016_j_ejor_2021_10_064
crossref_primary_10_1016_j_ipl_2022_106343
crossref_primary_10_1007_s10288_021_00480_3
crossref_primary_10_1007_s10951_013_0311_7
crossref_primary_10_1016_j_disopt_2020_100609
crossref_primary_10_1007_s10951_007_0049_1
crossref_primary_10_1016_j_disopt_2017_02_004
crossref_primary_10_1080_00207543_2021_1962017
crossref_primary_10_1080_02522667_2008_10699820
crossref_primary_10_1057_palgrave_jors_2602467
crossref_primary_10_1007_s00170_014_6262_0
crossref_primary_10_1007_s00170_014_5686_x
crossref_primary_10_1016_j_dss_2006_06_006
crossref_primary_10_1080_10170669_2012_737374
crossref_primary_10_1016_j_cor_2015_05_015
crossref_primary_10_1007_s11750_014_0337_9
crossref_primary_10_1051_ro_2012023
crossref_primary_10_1016_j_cie_2021_107835
crossref_primary_10_1057_palgrave_jors_2602480
crossref_primary_10_1016_j_endm_2010_05_156
crossref_primary_10_1016_j_omega_2024_103114
crossref_primary_10_1080_00207543_2019_1657245
crossref_primary_10_1016_j_cor_2009_10_002
crossref_primary_10_1007_s00170_008_1906_6
crossref_primary_10_1007_s10951_023_00793_7
crossref_primary_10_1016_j_ejor_2009_12_028
Cites_doi 10.1007/s00607-001-1441-x
10.1137/0211058
10.1057/jors.1995.102
10.1287/opre.39.5.836
10.1016/S0167-5060(08)70356-X
10.1023/A:1009622230725
10.1080/05695558008974515
10.1287/opre.42.1.102
10.1007/s10107-002-0324-z
10.1016/S0304-3975(01)00220-1
10.1016/S0167-6377(97)00025-4
10.1287/moor.23.4.930
10.1016/S0166-218X(01)00334-1
10.1016/S0305-0548(97)00038-5
10.1016/S0377-2217(97)00338-X
10.1002/nav.20000
10.1287/ijoc.8.4.402
10.1016/0377-2217(80)90038-7
10.1016/0166-218X(90)90105-L
10.1016/S0377-2217(82)80008-8
10.1057/jors.1992.126
10.1137/S0895480196300522
10.1016/S0377-2217(02)00265-5
10.1016/S0167-6377(01)00080-3
10.1111/j.1467-9574.1990.tb01276.x
10.1002/nav.3800220314
10.1287/opre.21.3.846
10.1287/opre.39.5.847
10.1002/nav.3800220317
10.1016/S0377-2217(01)00181-3
10.1137/0218022
10.1287/moor.15.3.483
10.1002/nav.3800280411
10.1016/0305-0483(87)90015-6
10.1016/0305-0548(90)90022-Y
10.1057/palgrave.jors.2600442
10.1023/A:1018974428912
10.1287/moor.13.2.330
10.1016/S0377-2217(00)00288-5
10.1016/S0167-6377(96)00035-1
10.1016/0166-218X(94)90144-9
10.1002/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO;2-2
10.1287/moor.21.1.100
10.1016/0377-2217(96)00129-4
10.1002/nav.3800330206
10.1016/0377-2217(88)90355-4
10.1002/1520-6750(199412)41:7<913::AID-NAV3220410705>3.0.CO;2-A
10.1016/S0305-0548(02)00021-7
10.1287/mnsc.30.11.1268
10.1016/0305-0483(89)90063-7
10.1287/opre.1030.0101
10.1287/ijoc.1030.0034
10.1287/ijoc.9.1.92
10.1287/opre.41.4.797
10.1287/opre.27.5.925
10.1287/ijoc.7.1.63
10.1023/A:1022231419049
10.1016/S0377-2217(99)00426-9
10.1016/0377-2217(93)90236-G
10.1002/j.1538-7305.1966.tb01709.x
10.1023/A:1014971620268
10.1016/S0377-2217(95)00363-0
10.1007/BF01585745
10.1287/opre.38.1.22
10.1016/0377-2217(91)90228-N
10.1002/nav.3800030106
10.1016/S0377-2217(98)00136-2
10.1016/0166-218X(94)00071-5
10.1002/(SICI)1099-1425(199911/12)2:6<253::AID-JOS30>3.0.CO;2-R
10.1145/322047.322055
10.1002/nav.3800330105
10.1016/S0377-2217(98)00009-5
10.1287/mnsc.32.4.464
10.1006/jagm.1996.0051
10.1016/S0305-0548(99)00005-2
10.1016/0377-2217(93)90245-I
10.1016/S0020-0190(01)00143-0
10.1287/opre.28.5.1155
10.1080/07408179508936738
10.1080/07408179808966450
10.1016/S0305-0548(03)00187-4
10.1016/S0925-5273(00)00039-6
10.1016/S0925-5273(98)00166-2
10.1016/S0377-2217(01)00302-2
10.1287/moor.1.2.117
10.1016/S0196-6774(03)00078-6
10.1145/322092.322101
10.1016/0305-0548(83)90018-7
10.1287/moor.6.1.153
10.1287/ijoc.14.1.37.7706
10.1137/0215081
10.1023/A:1026224610295
10.1016/0167-6377(95)00023-D
ContentType Journal Article
Copyright 2004 Elsevier B.V.
2005 INIST-CNRS
Copyright_xml – notice: 2004 Elsevier B.V.
– notice: 2005 INIST-CNRS
DBID IQODW
DKI
X2L
AAYXX
CITATION
DOI 10.1016/j.ejor.2004.07.011
DatabaseName Pascal-Francis
RePEc IDEAS
RePEc
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: DKI
  name: RePEc IDEAS
  url: http://ideas.repec.org/
  sourceTypes: Index Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
Applied Sciences
EISSN 1872-6860
EndPage 623
ExternalDocumentID 10_1016_j_ejor_2004_07_011
eeeejores_v_3a167_3ay_3a2005_3ai_3a3_3ap_3a592_623_htm
17035464
S0377221704004680
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1OL
1RT
1~.
1~5
29G
4.4
41~
457
4G.
5GY
5VS
6OB
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
AAYOK
ABAOU
ABBOA
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACIWK
ACNCT
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADIYS
ADJOM
ADMUD
AEBSH
AEFWE
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
RXW
SCC
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
VH1
WUQ
XPP
ZMT
~02
~G-
08R
6XO
AALMO
AAPBV
ABFLS
ABPIF
ABQIS
ADALY
IPNFZ
IQODW
PQEST
02
0R
1
41
8P
DKI
G-
HZ
K
M
MS
STF
X
X2L
AAXKI
AAYXX
AFJKZ
AKRWK
CITATION
ID FETCH-LOGICAL-c452t-53edd32c5b8a1dbfc35d86bf7e5ec5ddaa38b61178b650d1a1297813c56ae8923
IEDL.DBID AIKHN
ISSN 0377-2217
IngestDate Thu Sep 26 16:31:25 EDT 2024
Wed Aug 18 03:50:57 EDT 2021
Fri Nov 25 06:01:51 EST 2022
Fri Feb 23 02:32:20 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Simultaneous approximation
Machine scheduling
Pareto optimal
Earliness-tardiness
Controllable processing times
Multicriteria
Pareto optimum
Multicriteria analysis
Parallel machines
Processing time
Scheduling
Controllability
Earliness
Simultaneity
Language English
License CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c452t-53edd32c5b8a1dbfc35d86bf7e5ec5ddaa38b61178b650d1a1297813c56ae8923
PageCount 32
ParticipantIDs crossref_primary_10_1016_j_ejor_2004_07_011
repec_primary_eeeejores_v_3a167_3ay_3a2005_3ai_3a3_3ap_3a592_623_htm
pascalfrancis_primary_17035464
elsevier_sciencedirect_doi_10_1016_j_ejor_2004_07_011
PublicationCentury 2000
PublicationDate 2005-12-16
PublicationDateYYYYMMDD 2005-12-16
PublicationDate_xml – month: 12
  year: 2005
  text: 2005-12-16
  day: 16
PublicationDecade 2000
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationSeriesTitle European Journal of Operational Research
PublicationTitle European journal of operational research
PublicationYear 2005
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Nowicki, Zdrzałka (bib78) 1988; 34
Hoogeveen, Woeginger (bib54) 2002; 68
Wan, Yen, Li (bib108) 2001; 79
Lawler, E.L., 1982. Scheduling a single machine to minimize the number of late jobs. Preprint, Computer Science Division, University of California, Berkeley
Bülbül, K., Kaminsky, P., Yano, C., 2003. Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs. Department of IEOR, University of California at Berkeley
Torng, E., Uthaisombut, P., 1999. Lower bounds for sprt-subsequence algorithms for nonpreemptive scheduling. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 973–974
Zhang, Tang, Chen (bib113) 2001; 29
Graham, Lawler, Lenstra, Rinnooy Kan (bib37) 1979; 5
Sourd (bib90) 2001; 107
Baker, Scudder (bib8) 1990; 38
Bartal, Leonardi, Marchetti-Spaccamela, Sgall, Stougie (bib10) 2000; 13
T’kindt, Billaut, Proust (bib98) 2001; 135
Nelson, Sarin, Daniels (bib77) 1986; 32
Smith (bib89) 1956; 1
Chakrabarti, Phillips, Schulz, Shmoys, Stein, Wein (bib14) 1996; vol. 1099
Rajendran (bib82) 1992; 43
Dessouky, Lageweg, Lenstra, Van de Velde (bib22) 1990; 44
Gupta, Neppalli, Werner (bib39) 2001; 69
Leung, Young (bib71) 1989; 18
Vickson (bib106) 1980; 28
Hall, Potts (bib43) 2004; 42
Karasakal, Köksalan (bib61) 2000; 6
Bazaraa, Jarvis, Sherali (bib11) 1990
Huang, G., Lim, A., 2003. A new approach to solve a 2-machine bicriteria flowshop scheduling problem. In: Proceedings of the 5th International Workshop on Integration of Artificial Intelligence and Operations Research techniques in Constraints Programming for Combinatorial Optimization, CPAIOR’03
Mohri, Masuda, Ishii (bib75) 1999; 60–61
Hurkens, C.A.J., Coster, M.J., unpublished manuscript. On the makespan of a schedule minimizing total completion time for unrelated parallel machines
Hoogeveen, van de Velde (bib52) 1997; 9
Fry, Armstrong, Lewis (bib30) 1989; 17
Baker, Smith (bib9) 2003; 6
Evans (bib29) 1984; 30
Horn (bib55) 1973; 21
Fry, Keong Leong (bib31) 1987; 15
Graham (bib36) 1966; 45
Gordon, Proth, Chu (bib35) 2002; 139
Hall, Posner (bib42) 1991; 39
Kyparisis, Koulamas (bib65) 2000; 27
Alidaee, Ahmadian (bib3) 1993; 70
Hoogeveen, van de Velde (bib49) 1991; 55
Hoogeveen, van de Velde (bib50) 1995; 17
Gonzalez, Sahni (bib34) 1976; 25
Hall, Kubiak, Sethi (bib41) 1991; 39
Garey, Tarjan, Wilfong (bib33) 1988; 13
Hall (bib40) 1986; 33
Kawaguchi, Kyan (bib62) 1986; 15
Kim, Yano (bib63) 1994; 41
Sourd (bib92) 2004; 16
Vickson (bib105) 1980; 12
Daniels, Chambers (bib21) 1990; 40
T’kindt, Billaut (bib97) 2002
Hoogeveen, Skutella, Woeginger (bib48) 2003; 94
Lenstra, Tardos, Shmoys (bib70) 1990; 46
Nowicki, Zdrzałka (bib80) 1995; 63
Hoogeveen, Oosterhout, van de Velde (bib47) 1994; 42
Sivrikaya-Serifoglu, Ulusoy (bib88) 1998; 107
Eck, Pinedo (bib24) 1993; 41
Emmons (bib27) 1987; 34
Hoogeveen (bib46) 1996; 21
Van den Akker, Hoogeveen, Van de Velde (bib109) 2002; 14
Wennink, M., 1995. Algorithmic support for automated planning boards. PhD Thesis, Eindhoven University of Technology
T’kindt, Gupta, Billaut (bib99) 2003; 30
Sourd, F., in press. Scheduling a sequence of tasks with general completion costs. European Journal of Operational Research
Tadei, Grosso, Della Croce (bib96) 2002; 124
Lawler, Lenstra, Rinnooy Kan (bib68) 1981; 6
van Wassenhove, Baker (bib110) 1982; 11
Emmons (bib25) 1975; 22
Hoogeveen, van de Velde (bib53) 2001; 129
Shabtay, Kaspi (bib86) 2004; 31
Liao, Yu, Joe (bib72) 1997; 48
Vairaktarakis, Lee (bib103) 1995; 27
Hoogeveen, van de Velde (bib51) 1996; 8
Lenstra, J.K., unpublished manuscript
Achugbue, Chin (bib1) 1982; 11
Shanthikumar (bib87) 1983; 10
Kanet (bib60) 1981; 28
T’kindt, Monmarché, Tercinet, Laugt (bib100) 2002; 142
Van Wassenhove, Gelders (bib111) 1980; 4
Bagchi, Sullivan, Chang (bib7) 1986; 33
Hoogeveen (bib45) 1996; 21
Gupta, Hariri, Potts (bib38) 1999; 92
Bülbül, K., Kaminsky, P., Yano, C., submitted for publication. Preemption in single machine earliness/tardiness scheduling. Naval Research Logistics, Department of IEOR, University of California at Berkeley
Aslam, J.A., Rasala, A., Stein, C., Young, N., 1999. Improved bicriteria existence theorems for scheduling. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 846–847
Sourd, F., submitted for publication. Punctuality and idleness in just-in-time scheduling. European Journal of Operational Research
Verma, Dessouky (bib104) 1998; 23
Ahuja, Magnanti, Orlin (bib2) 1993
Emmons (bib26) 1975; 22
Nagar, Heragu, Haddock (bib76) 1995; 46
Janiak, Kovalyov (bib59) 1996; 94
Cheng, Chen, Li (bib18) 1996; 19
Stein, Wein (bib95) 1997; 21
Lawler, Labetoulle (bib67) 1978; 25
Rasala, A., 1999. Existence theorems for scheduling to meet two objectives. Technical Report PCS-TR99-347, Dartmouth College
Hoogeveen, J.A., 1992. Single-Machine Bicriteria Scheduling. PhD Thesis, CWI, The Netherlands Technology, Amsterdam
Du, Leung (bib23) 1990; 15
Bagchi (bib6) 1989; 17
Garey, Johnson, Sethi (bib32) 1976; 1
Tuzikov, Makhaniok, Männer (bib102) 1998; 25
Sahni (bib84) 1979; 27
Wan, Yen (bib107) 2002; 142
Köksalan, Azizoglu, Kondakci (bib64) 1998; 30
Alidaee, Dragan (bib4) 1997; 96
Sayin, Karabati (bib85) 1999; 113
Chen, Powell (bib17) 1999; 116
Cheng, Shakhlevich (bib19) 1999; 2
Pinedo (bib81) 2002
Engels, Karger, Kolliopoulos, Sengupta, Uma, Wein (bib28) 2003; 49
Jackson, J.R., 1955. Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Sciences Research Project, UCLA
Chen, Bulfin (bib16) 1993; 70
Sourd, Kedad-Sidhoum (bib94) 2003; 6
Chen, Bulfin (bib15) 1990; 17
Chrétienne, Sourd (bib20) 2003; 292
McCormick, Pinedo (bib74) 1995; 7
Masuda, Ishii (bib73) 1994; 52
Nowicki, Zdrzałka (bib79) 1990; 26
Cheng (10.1016/j.ejor.2004.07.011_bib18) 1996; 19
Alidaee (10.1016/j.ejor.2004.07.011_bib4) 1997; 96
T’kindt (10.1016/j.ejor.2004.07.011_bib98) 2001; 135
Hoogeveen (10.1016/j.ejor.2004.07.011_bib47) 1994; 42
Shabtay (10.1016/j.ejor.2004.07.011_bib86) 2004; 31
Gonzalez (10.1016/j.ejor.2004.07.011_bib34) 1976; 25
10.1016/j.ejor.2004.07.011_bib56
Hall (10.1016/j.ejor.2004.07.011_bib42) 1991; 39
10.1016/j.ejor.2004.07.011_bib57
Ahuja (10.1016/j.ejor.2004.07.011_bib2) 1993
10.1016/j.ejor.2004.07.011_bib58
Nagar (10.1016/j.ejor.2004.07.011_bib76) 1995; 46
10.1016/j.ejor.2004.07.011_bib112
Chakrabarti (10.1016/j.ejor.2004.07.011_bib14) 1996; vol. 1099
Alidaee (10.1016/j.ejor.2004.07.011_bib3) 1993; 70
Bartal (10.1016/j.ejor.2004.07.011_bib10) 2000; 13
Hall (10.1016/j.ejor.2004.07.011_bib43) 2004; 42
Smith (10.1016/j.ejor.2004.07.011_bib89) 1956; 1
Hoogeveen (10.1016/j.ejor.2004.07.011_bib54) 2002; 68
T’kindt (10.1016/j.ejor.2004.07.011_bib100) 2002; 142
Masuda (10.1016/j.ejor.2004.07.011_bib73) 1994; 52
McCormick (10.1016/j.ejor.2004.07.011_bib74) 1995; 7
Gordon (10.1016/j.ejor.2004.07.011_bib35) 2002; 139
Lawler (10.1016/j.ejor.2004.07.011_bib68) 1981; 6
Stein (10.1016/j.ejor.2004.07.011_bib95) 1997; 21
Mohri (10.1016/j.ejor.2004.07.011_bib75) 1999; 60–61
Achugbue (10.1016/j.ejor.2004.07.011_bib1) 1982; 11
10.1016/j.ejor.2004.07.011_bib44
10.1016/j.ejor.2004.07.011_bib101
Hoogeveen (10.1016/j.ejor.2004.07.011_bib53) 2001; 129
Garey (10.1016/j.ejor.2004.07.011_bib33) 1988; 13
Engels (10.1016/j.ejor.2004.07.011_bib28) 2003; 49
Hoogeveen (10.1016/j.ejor.2004.07.011_bib45) 1996; 21
Leung (10.1016/j.ejor.2004.07.011_bib71) 1989; 18
Hoogeveen (10.1016/j.ejor.2004.07.011_bib46) 1996; 21
Bagchi (10.1016/j.ejor.2004.07.011_bib6) 1989; 17
Gupta (10.1016/j.ejor.2004.07.011_bib39) 2001; 69
Graham (10.1016/j.ejor.2004.07.011_bib36) 1966; 45
Gupta (10.1016/j.ejor.2004.07.011_bib38) 1999; 92
Nowicki (10.1016/j.ejor.2004.07.011_bib79) 1990; 26
Kim (10.1016/j.ejor.2004.07.011_bib63) 1994; 41
T’kindt (10.1016/j.ejor.2004.07.011_bib97) 2002
Emmons (10.1016/j.ejor.2004.07.011_bib26) 1975; 22
Liao (10.1016/j.ejor.2004.07.011_bib72) 1997; 48
Vickson (10.1016/j.ejor.2004.07.011_bib105) 1980; 12
Evans (10.1016/j.ejor.2004.07.011_bib29) 1984; 30
Vairaktarakis (10.1016/j.ejor.2004.07.011_bib103) 1995; 27
Köksalan (10.1016/j.ejor.2004.07.011_bib64) 1998; 30
10.1016/j.ejor.2004.07.011_bib66
Rajendran (10.1016/j.ejor.2004.07.011_bib82) 1992; 43
Sahni (10.1016/j.ejor.2004.07.011_bib84) 1979; 27
10.1016/j.ejor.2004.07.011_bib69
Wan (10.1016/j.ejor.2004.07.011_bib107) 2002; 142
Shanthikumar (10.1016/j.ejor.2004.07.011_bib87) 1983; 10
Karasakal (10.1016/j.ejor.2004.07.011_bib61) 2000; 6
Tadei (10.1016/j.ejor.2004.07.011_bib96) 2002; 124
Bazaraa (10.1016/j.ejor.2004.07.011_bib11) 1990
Dessouky (10.1016/j.ejor.2004.07.011_bib22) 1990; 44
Chen (10.1016/j.ejor.2004.07.011_bib17) 1999; 116
Du (10.1016/j.ejor.2004.07.011_bib23) 1990; 15
10.1016/j.ejor.2004.07.011_bib91
Chen (10.1016/j.ejor.2004.07.011_bib16) 1993; 70
10.1016/j.ejor.2004.07.011_bib93
Janiak (10.1016/j.ejor.2004.07.011_bib59) 1996; 94
Bagchi (10.1016/j.ejor.2004.07.011_bib7) 1986; 33
Hoogeveen (10.1016/j.ejor.2004.07.011_bib49) 1991; 55
10.1016/j.ejor.2004.07.011_bib12
10.1016/j.ejor.2004.07.011_bib13
Tuzikov (10.1016/j.ejor.2004.07.011_bib102) 1998; 25
Kawaguchi (10.1016/j.ejor.2004.07.011_bib62) 1986; 15
Emmons (10.1016/j.ejor.2004.07.011_bib27) 1987; 34
Kyparisis (10.1016/j.ejor.2004.07.011_bib65) 2000; 27
Sourd (10.1016/j.ejor.2004.07.011_bib94) 2003; 6
van Wassenhove (10.1016/j.ejor.2004.07.011_bib110) 1982; 11
Kanet (10.1016/j.ejor.2004.07.011_bib60) 1981; 28
Pinedo (10.1016/j.ejor.2004.07.011_bib81) 2002
Van den Akker (10.1016/j.ejor.2004.07.011_bib109) 2002; 14
Sourd (10.1016/j.ejor.2004.07.011_bib92) 2004; 16
10.1016/j.ejor.2004.07.011_bib83
Fry (10.1016/j.ejor.2004.07.011_bib31) 1987; 15
10.1016/j.ejor.2004.07.011_bib5
Van Wassenhove (10.1016/j.ejor.2004.07.011_bib111) 1980; 4
Chen (10.1016/j.ejor.2004.07.011_bib15) 1990; 17
Sourd (10.1016/j.ejor.2004.07.011_bib90) 2001; 107
Nowicki (10.1016/j.ejor.2004.07.011_bib80) 1995; 63
Baker (10.1016/j.ejor.2004.07.011_bib8) 1990; 38
Hoogeveen (10.1016/j.ejor.2004.07.011_bib48) 2003; 94
Sivrikaya-Serifoglu (10.1016/j.ejor.2004.07.011_bib88) 1998; 107
Lawler (10.1016/j.ejor.2004.07.011_bib67) 1978; 25
Garey (10.1016/j.ejor.2004.07.011_bib32) 1976; 1
Cheng (10.1016/j.ejor.2004.07.011_bib19) 1999; 2
Zhang (10.1016/j.ejor.2004.07.011_bib113) 2001; 29
Horn (10.1016/j.ejor.2004.07.011_bib55) 1973; 21
Hoogeveen (10.1016/j.ejor.2004.07.011_bib50) 1995; 17
Hoogeveen (10.1016/j.ejor.2004.07.011_bib52) 1997; 9
Fry (10.1016/j.ejor.2004.07.011_bib30) 1989; 17
Vickson (10.1016/j.ejor.2004.07.011_bib106) 1980; 28
Wan (10.1016/j.ejor.2004.07.011_bib108) 2001; 79
T’kindt (10.1016/j.ejor.2004.07.011_bib99) 2003; 30
Graham (10.1016/j.ejor.2004.07.011_bib37) 1979; 5
Hall (10.1016/j.ejor.2004.07.011_bib41) 1991; 39
Hall (10.1016/j.ejor.2004.07.011_bib40) 1986; 33
Nowicki (10.1016/j.ejor.2004.07.011_bib78) 1988; 34
Nelson (10.1016/j.ejor.2004.07.011_bib77) 1986; 32
Eck (10.1016/j.ejor.2004.07.011_bib24) 1993; 41
Daniels (10.1016/j.ejor.2004.07.011_bib21) 1990; 40
Sayin (10.1016/j.ejor.2004.07.011_bib85) 1999; 113
Chrétienne (10.1016/j.ejor.2004.07.011_bib20) 2003; 292
Emmons (10.1016/j.ejor.2004.07.011_bib25) 1975; 22
Verma (10.1016/j.ejor.2004.07.011_bib104) 1998; 23
Hoogeveen (10.1016/j.ejor.2004.07.011_bib51) 1996; 8
Lenstra (10.1016/j.ejor.2004.07.011_bib70) 1990; 46
Baker (10.1016/j.ejor.2004.07.011_bib9) 2003; 6
References_xml – volume: 34
  start-page: 208
  year: 1988
  end-page: 220
  ident: bib78
  article-title: A two-machine flow shop scheduling problem with controllable job processing times
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Zdrzałka
– volume: 21
  start-page: 115
  year: 1997
  end-page: 122
  ident: bib95
  article-title: On the existence of schedules that are near-optimal for both makespan and total weighted completion time
  publication-title: Operations Research Letters
  contributor:
    fullname: Wein
– volume: 16
  start-page: 198
  year: 2004
  end-page: 208
  ident: bib92
  article-title: The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
  publication-title: INFORMS Journal on Computing
  contributor:
    fullname: Sourd
– volume: 42
  start-page: 102
  year: 1994
  end-page: 110
  ident: bib47
  article-title: New lower and upper bounds for scheduling around a small common due date
  publication-title: Operations Research
  contributor:
    fullname: van de Velde
– volume: 41
  start-page: 797
  year: 1993
  end-page: 801
  ident: bib24
  article-title: On the minimization of the makespan subject to flowtime optimality
  publication-title: Operations Research
  contributor:
    fullname: Pinedo
– volume: 42
  start-page: 440
  year: 2004
  end-page: 453
  ident: bib43
  article-title: Rescheduling for new orders
  publication-title: Operations Research
  contributor:
    fullname: Potts
– volume: 9
  start-page: 92
  year: 1997
  end-page: 99
  ident: bib52
  article-title: Earliness–tardiness scheduling around almost equal due dates
  publication-title: INFORMS Journal on Computing
  contributor:
    fullname: van de Velde
– year: 1990
  ident: bib11
  article-title: Linear Programming and Network Flows
  contributor:
    fullname: Sherali
– volume: 27
  start-page: 250
  year: 1995
  end-page: 256
  ident: bib103
  article-title: The single machine problem to minimize total tardiness subject to minimum number of tardy jobs
  publication-title: IIE Transactions
  contributor:
    fullname: Lee
– volume: 107
  start-page: 414
  year: 1998
  end-page: 430
  ident: bib88
  article-title: A bicriteria two machine permutation flowshop problem
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Ulusoy
– volume: 142
  start-page: 250
  year: 2002
  end-page: 257
  ident: bib100
  article-title: An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Laugt
– volume: 46
  start-page: 259
  year: 1990
  end-page: 271
  ident: bib70
  article-title: Approximation algorithms for scheduling unrelated parallel machines
  publication-title: Mathematical Programming
  contributor:
    fullname: Shmoys
– volume: 60–61
  start-page: 529
  year: 1999
  end-page: 536
  ident: bib75
  article-title: Bi-criteria scheduling problem on three identical parallel machines
  publication-title: International Journal of Production Economics
  contributor:
    fullname: Ishii
– volume: 15
  start-page: 483
  year: 1990
  end-page: 495
  ident: bib23
  article-title: Minimizing total tardiness on one machine is NP-hard
  publication-title: Mathematics of Operations Research
  contributor:
    fullname: Leung
– volume: 113
  start-page: 435
  year: 1999
  end-page: 449
  ident: bib85
  article-title: A bicriteria approach to the two-machine flow shop scheduling problem
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Karabati
– volume: 33
  start-page: 227
  year: 1986
  end-page: 240
  ident: bib7
  article-title: Minimizing mean absolute deviation of completion times about a common due date
  publication-title: Naval Research Logistics Quarterly
  contributor:
    fullname: Chang
– volume: 32
  start-page: 464
  year: 1986
  end-page: 479
  ident: bib77
  article-title: Scheduling with multiple performance measures: The one-machine case
  publication-title: Management Science
  contributor:
    fullname: Daniels
– volume: 25
  start-page: 31
  year: 1998
  end-page: 35
  ident: bib102
  article-title: Bicriterion scheduling of identical processing time jobs by uniform processors
  publication-title: Computers & Operations Research
  contributor:
    fullname: Männer
– volume: 1
  start-page: 117
  year: 1976
  end-page: 129
  ident: bib32
  article-title: The complexity of flowshop and jobshop scheduling
  publication-title: Mathematics of Operations Research
  contributor:
    fullname: Sethi
– volume: 25
  start-page: 92
  year: 1976
  end-page: 101
  ident: bib34
  article-title: Open shop scheduling to minimize finish time
  publication-title: Journal of the Association for Computing Machinery
  contributor:
    fullname: Sahni
– volume: 94
  start-page: 284
  year: 1996
  end-page: 291
  ident: bib59
  article-title: Single machine scheduling subject to deadlines and resource dependent processing times
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Kovalyov
– volume: 6
  start-page: 311
  year: 2000
  end-page: 327
  ident: bib61
  article-title: A simulated annealing approach to bicriteria scheduling problems on a single machine
  publication-title: Journal of Heuristics
  contributor:
    fullname: Köksalan
– volume: 69
  start-page: 323
  year: 2001
  end-page: 338
  ident: bib39
  article-title: Minimizing total flow time in a two-machine flowshop problem with minimum makespan
  publication-title: International Journal of Production Economics
  contributor:
    fullname: Werner
– volume: 17
  start-page: 205
  year: 1995
  end-page: 208
  ident: bib50
  article-title: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
  publication-title: Operations Research Letters
  contributor:
    fullname: van de Velde
– volume: vol. 1099
  start-page: 646
  year: 1996
  end-page: 657
  ident: bib14
  article-title: Improved scheduling algorithms for minsum criteria
  publication-title: Lecture Notes in Computer Science
  contributor:
    fullname: Wein
– volume: 17
  start-page: 1
  year: 1990
  end-page: 7
  ident: bib15
  article-title: Scheduling unit processing time jobs on a single machine with multiple criteria
  publication-title: Computers and Operations Research
  contributor:
    fullname: Bulfin
– volume: 10
  start-page: 253
  year: 1983
  end-page: 265
  ident: bib87
  article-title: Scheduling jobs on one machine to minimize the maximum tardiness with minimum number of tardy
  publication-title: Computers & Operations Research
  contributor:
    fullname: Shanthikumar
– volume: 45
  start-page: 1563
  year: 1966
  end-page: 1581
  ident: bib36
  article-title: Bounds for certain multiprocessor anomalies
  publication-title: Bell System Technical Journal
  contributor:
    fullname: Graham
– volume: 49
  start-page: 175
  year: 2003
  end-page: 191
  ident: bib28
  article-title: Techniques for scheduling with rejection
  publication-title: Journal of Algorithms
  contributor:
    fullname: Wein
– volume: 52
  start-page: 253
  year: 1994
  end-page: 259
  ident: bib73
  article-title: Two machine open shop scheduling problem with bi-criteria
  publication-title: Discrete Applied Mathematics
  contributor:
    fullname: Ishii
– volume: 11
  start-page: 48
  year: 1982
  end-page: 54
  ident: bib110
  article-title: A bicriterion approach to time/cost tradeoffs in sequencing
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Baker
– volume: 4
  start-page: 42
  year: 1980
  end-page: 48
  ident: bib111
  article-title: Solving a bicriterion scheduling problem
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Gelders
– volume: 55
  start-page: 237
  year: 1991
  end-page: 242
  ident: bib49
  article-title: Scheduling around a small common due date
  publication-title: European Journal of Operational Research
  contributor:
    fullname: van de Velde
– volume: 46
  start-page: 721
  year: 1995
  end-page: 734
  ident: bib76
  article-title: A branch-and-bound approach for a two-machine flowshop scheduling problem
  publication-title: Journal of the Operational Research Society
  contributor:
    fullname: Haddock
– volume: 63
  start-page: 237
  year: 1995
  end-page: 256
  ident: bib80
  article-title: A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
  publication-title: Discrete Applied Mathematics
  contributor:
    fullname: Zdrzałka
– volume: 17
  start-page: 381
  year: 1989
  end-page: 386
  ident: bib6
  article-title: Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems
  publication-title: Operations Research
  contributor:
    fullname: Bagchi
– volume: 21
  start-page: 100
  year: 1996
  end-page: 114
  ident: bib45
  article-title: Minimizing maximum promptness and maximum lateness on a single machine
  publication-title: Mathematics of Operations Research
  contributor:
    fullname: Hoogeveen
– year: 2002
  ident: bib97
  article-title: Multicriteria Scheduling: Theory, Models and Algorithms
  contributor:
    fullname: Billaut
– volume: 96
  start-page: 559
  year: 1997
  end-page: 563
  ident: bib4
  article-title: A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Dragan
– volume: 68
  start-page: 181
  year: 2002
  end-page: 192
  ident: bib54
  article-title: Some comments on sequencing with controllable processing times
  publication-title: Computing
  contributor:
    fullname: Woeginger
– volume: 124
  start-page: 117
  year: 2002
  end-page: 126
  ident: bib96
  article-title: Finding the Pareto-optima for the total and maximum tardiness single machine problem
  publication-title: Discrete Applied Mathematics
  contributor:
    fullname: Della Croce
– volume: 7
  start-page: 63
  year: 1995
  end-page: 77
  ident: bib74
  article-title: Scheduling n independent jobs on m uniform machines with both flowtime and makespan objectives: a parametric analysis
  publication-title: ORSA Journal on Computing
  contributor:
    fullname: Pinedo
– volume: 48
  start-page: 929
  year: 1997
  end-page: 935
  ident: bib72
  article-title: Bicriterion scheduling in the two-machine flowshop
  publication-title: Journal of the Operational Research Society
  contributor:
    fullname: Joe
– volume: 2
  start-page: 253
  year: 1999
  end-page: 266
  ident: bib19
  article-title: Proportionate flow shops with controllable processing times
  publication-title: Journal of Scheduling
  contributor:
    fullname: Shakhlevich
– volume: 23
  start-page: 930
  year: 1998
  end-page: 943
  ident: bib104
  article-title: Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
  publication-title: Mathematics of Operations Research
  contributor:
    fullname: Dessouky
– volume: 30
  start-page: 505
  year: 2003
  end-page: 526
  ident: bib99
  article-title: Two-machine flowshop with a secondary criterion
  publication-title: Computers & Operations Research
  contributor:
    fullname: Billaut
– year: 2002
  ident: bib81
  article-title: Scheduling: Theory, Algorithms, and Systems
  contributor:
    fullname: Pinedo
– volume: 92
  start-page: 107
  year: 1999
  end-page: 123
  ident: bib38
  article-title: Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
  publication-title: Annals of Operations Research
  contributor:
    fullname: Potts
– volume: 44
  start-page: 115
  year: 1990
  end-page: 123
  ident: bib22
  article-title: Scheduling identical jobs on uniform parallel machines
  publication-title: Statistica Neerlandica
  contributor:
    fullname: Van de Velde
– volume: 15
  start-page: 277
  year: 1987
  end-page: 282
  ident: bib31
  article-title: Single machine scheduling: A comparison of two solution procedures
  publication-title: Omega
  contributor:
    fullname: Keong Leong
– volume: 139
  start-page: 1
  year: 2002
  end-page: 25
  ident: bib35
  article-title: A survey of the state-of-the-art of common due date assignment and scheduling research
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Chu
– volume: 28
  start-page: 1155
  year: 1980
  end-page: 1167
  ident: bib106
  article-title: Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine
  publication-title: Operations Research
  contributor:
    fullname: Vickson
– volume: 13
  start-page: 330
  year: 1988
  end-page: 348
  ident: bib33
  article-title: One-processor scheduling with symmetric earliness and tardiness penalties
  publication-title: Mathematics of Operations Research
  contributor:
    fullname: Wilfong
– volume: 5
  start-page: 287
  year: 1979
  end-page: 326
  ident: bib37
  article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey
  publication-title: Annals of Discrete Mathematics
  contributor:
    fullname: Rinnooy Kan
– volume: 26
  start-page: 271
  year: 1990
  end-page: 287
  ident: bib79
  article-title: A survey of results for sequencing problems with controllable processing times
  publication-title: Discrete Applied Mathematics
  contributor:
    fullname: Zdrzałka
– volume: 27
  start-page: 15
  year: 2000
  end-page: 27
  ident: bib65
  article-title: Open shop scheduling with makespan and total completion time criteria
  publication-title: Computers & Operations Research
  contributor:
    fullname: Koulamas
– volume: 31
  start-page: 2279
  year: 2004
  end-page: 2289
  ident: bib86
  article-title: Minimizing the total weighted flow time in a single machine with controllable processing times
  publication-title: Computers & Operations Research
  contributor:
    fullname: Kaspi
– volume: 79
  start-page: 273
  year: 2001
  end-page: 280
  ident: bib108
  article-title: Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard
  publication-title: Information Processing Letters
  contributor:
    fullname: Li
– volume: 11
  start-page: 665
  year: 1982
  end-page: 679
  ident: bib1
  article-title: Scheduling the openshop to minimize mean flow time
  publication-title: SIAM Journal on Computing
  contributor:
    fullname: Chin
– volume: 70
  start-page: 115
  year: 1993
  end-page: 125
  ident: bib16
  article-title: Complexity of single machine, multi-criteria scheduling problems
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Bulfin
– volume: 22
  start-page: 615
  year: 1975
  end-page: 616
  ident: bib26
  article-title: A note on a scheduling problem with dual criteria
  publication-title: Naval Research Logistics Quarterly
  contributor:
    fullname: Emmons
– volume: 39
  start-page: 847
  year: 1991
  end-page: 856
  ident: bib41
  article-title: Earliness–tardiness scheduling problems, II: Deviation of completion times about a common due date
  publication-title: Operations Research
  contributor:
    fullname: Sethi
– volume: 17
  start-page: 595
  year: 1989
  end-page: 607
  ident: bib30
  article-title: A framework for single machine multiple objective sequencing research
  publication-title: Omega
  contributor:
    fullname: Lewis
– volume: 6
  start-page: 153
  year: 1981
  end-page: 158
  ident: bib68
  article-title: Minimizing maximum lateness in a two-machine open shop
  publication-title: Mathematics of Operations Research
  contributor:
    fullname: Rinnooy Kan
– volume: 135
  start-page: 42
  year: 2001
  end-page: 49
  ident: bib98
  article-title: An interactive algorithm to solve bicriteria scheduling problems on unrelated parallel machines
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Proust
– volume: 6
  start-page: 7
  year: 2003
  end-page: 16
  ident: bib9
  article-title: A multiple-criterion model for machine scheduling
  publication-title: Journal of Scheduling
  contributor:
    fullname: Smith
– volume: 21
  start-page: 846
  year: 1973
  end-page: 847
  ident: bib55
  article-title: Minimizing average flow time with parallel machines
  publication-title: Operations Research
  contributor:
    fullname: Horn
– volume: 39
  start-page: 836
  year: 1991
  end-page: 846
  ident: bib42
  article-title: Earliness–tardiness scheduling problems, I: weighted deviation of completion times about a common due date
  publication-title: Operations Research
  contributor:
    fullname: Posner
– volume: 30
  start-page: 192
  year: 1998
  end-page: 200
  ident: bib64
  article-title: Minimizing flow time and maximum earliness on a single machine
  publication-title: IIE Transactions
  contributor:
    fullname: Kondakci
– volume: 94
  start-page: 361
  year: 2003
  end-page: 374
  ident: bib48
  article-title: Preemptive scheduling with rejection
  publication-title: Mathematical Programming B
  contributor:
    fullname: Woeginger
– volume: 70
  start-page: 335
  year: 1993
  end-page: 341
  ident: bib3
  article-title: Two parallel machine sequencing problems involving controllable job processing times
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Ahmadian
– volume: 34
  start-page: 803
  year: 1987
  end-page: 810
  ident: bib27
  article-title: Scheduling to a common due date on parallel uniform processors
  publication-title: Naval Research Logistics
  contributor:
    fullname: Emmons
– volume: 8
  start-page: 402
  year: 1996
  end-page: 412
  ident: bib51
  article-title: A branch-and-bound algorithm for single-machine earliness–tardiness scheduling with idle time
  publication-title: INFORMS Journal on Computing
  contributor:
    fullname: van de Velde
– volume: 142
  start-page: 271
  year: 2002
  end-page: 281
  ident: bib107
  article-title: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Yen
– volume: 116
  start-page: 220
  year: 1999
  end-page: 232
  ident: bib17
  article-title: A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Powell
– year: 1993
  ident: bib2
  article-title: Network Flows—Theory, Algorithms, and Applications
  contributor:
    fullname: Orlin
– volume: 29
  start-page: 41
  year: 2001
  end-page: 47
  ident: bib113
  article-title: A
  publication-title: Operations Research Letters
  contributor:
    fullname: Chen
– volume: 22
  start-page: 585
  year: 1975
  end-page: 592
  ident: bib25
  article-title: One machine sequencing to minimize mean flow time with minimum number of tardy
  publication-title: Naval Research Logistics Quarterly
  contributor:
    fullname: Emmons
– volume: 19
  start-page: 237
  year: 1996
  end-page: 242
  ident: bib18
  article-title: Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
  publication-title: Operations Research Letters
  contributor:
    fullname: Li
– volume: 41
  start-page: 913
  year: 1994
  end-page: 933
  ident: bib63
  article-title: Minimizing mean tardiness and earliness in single machine scheduling problems with unequal due dates
  publication-title: Naval Research Logistics
  contributor:
    fullname: Yano
– volume: 25
  start-page: 612
  year: 1978
  end-page: 619
  ident: bib67
  article-title: On preemptive scheduling of unrelated parallel machines with linear programming
  publication-title: Journal of the Association of Computing Machinery
  contributor:
    fullname: Labetoulle
– volume: 43
  start-page: 871
  year: 1992
  end-page: 884
  ident: bib82
  article-title: Two-stage flow shop scheduling problem with bicriteria
  publication-title: Journal of the Operational Research Society
  contributor:
    fullname: Rajendran
– volume: 15
  start-page: 1119
  year: 1986
  end-page: 1129
  ident: bib62
  article-title: Worst case bound of an LRF schedule for the mean weighted flow time problem
  publication-title: SIAM Journal on Computing
  contributor:
    fullname: Kyan
– volume: 33
  start-page: 49
  year: 1986
  end-page: 54
  ident: bib40
  article-title: Single-and multiple-processor models for minimizing completion time variance
  publication-title: Naval Research Logistics Quarterly
  contributor:
    fullname: Hall
– volume: 107
  start-page: 303
  year: 2001
  end-page: 319
  ident: bib90
  article-title: Preemptive scheduling with two minimax criteria
  publication-title: Annals of Operations Research
  contributor:
    fullname: Sourd
– volume: 12
  start-page: 258
  year: 1980
  end-page: 262
  ident: bib105
  article-title: Two single machine sequencing problems involving controllable job processing times
  publication-title: AIIE Transactions
  contributor:
    fullname: Vickson
– volume: 27
  start-page: 925
  year: 1979
  end-page: 934
  ident: bib84
  article-title: Preemptive scheduling with due dates
  publication-title: Operations Research
  contributor:
    fullname: Sahni
– volume: 13
  start-page: 64
  year: 2000
  end-page: 78
  ident: bib10
  article-title: Multiprocessor scheduling with rejection
  publication-title: SIAM Journal on Discrete Mathematics
  contributor:
    fullname: Stougie
– volume: 38
  start-page: 22
  year: 1990
  end-page: 36
  ident: bib8
  article-title: Sequencing with earliness and tardiness penalties: A review
  publication-title: Operations Research
  contributor:
    fullname: Scudder
– volume: 21
  start-page: 415
  year: 1996
  end-page: 433
  ident: bib46
  article-title: Single-machine scheduling to minimize a function of two or three maximum cost criteria
  publication-title: Journal of Algorithms
  contributor:
    fullname: Hoogeveen
– volume: 6
  start-page: 533
  year: 2003
  end-page: 549
  ident: bib94
  article-title: The one machine problem with earliness and tardiness penalties
  publication-title: Journal of Scheduling
  contributor:
    fullname: Kedad-Sidhoum
– volume: 30
  start-page: 1268
  year: 1984
  end-page: 1282
  ident: bib29
  article-title: An overview of techniques for solving multiobjective mathematical programs
  publication-title: Management Science
  contributor:
    fullname: Evans
– volume: 28
  start-page: 643
  year: 1981
  end-page: 651
  ident: bib60
  article-title: Minimizing the average deviation of job completion times about a common due date
  publication-title: Naval Research Logistics Quarterly
  contributor:
    fullname: Kanet
– volume: 18
  start-page: 314
  year: 1989
  end-page: 326
  ident: bib71
  article-title: Minimizing schedule length subject to minimum flow time
  publication-title: SIAM Journal on Computing
  contributor:
    fullname: Young
– volume: 1
  start-page: 59
  year: 1956
  end-page: 66
  ident: bib89
  article-title: Various optimizers for single-stage production
  publication-title: Naval Research Logistics Quarterly
  contributor:
    fullname: Smith
– volume: 14
  start-page: 37
  year: 2002
  end-page: 51
  ident: bib109
  article-title: Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem
  publication-title: INFORMS Journal on Computing
  contributor:
    fullname: Van de Velde
– volume: 40
  start-page: 85
  year: 1990
  end-page: 101
  ident: bib21
  article-title: Multiobjective flow-shop scheduling
  publication-title: Naval Research Logistics
  contributor:
    fullname: Chambers
– volume: 129
  start-page: 87
  year: 2001
  end-page: 94
  ident: bib53
  article-title: Scheduling with target start times
  publication-title: European Journal of Operational Research
  contributor:
    fullname: van de Velde
– volume: 292
  start-page: 145
  year: 2003
  end-page: 164
  ident: bib20
  article-title: PERT scheduling with convex cost functions
  publication-title: Theoretical Computer Science
  contributor:
    fullname: Sourd
– volume: 68
  start-page: 181
  year: 2002
  ident: 10.1016/j.ejor.2004.07.011_bib54
  article-title: Some comments on sequencing with controllable processing times
  publication-title: Computing
  doi: 10.1007/s00607-001-1441-x
  contributor:
    fullname: Hoogeveen
– volume: 11
  start-page: 665
  year: 1982
  ident: 10.1016/j.ejor.2004.07.011_bib1
  article-title: Scheduling the openshop to minimize mean flow time
  publication-title: SIAM Journal on Computing
  doi: 10.1137/0211058
  contributor:
    fullname: Achugbue
– volume: 46
  start-page: 721
  year: 1995
  ident: 10.1016/j.ejor.2004.07.011_bib76
  article-title: A branch-and-bound approach for a two-machine flowshop scheduling problem
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/jors.1995.102
  contributor:
    fullname: Nagar
– volume: 39
  start-page: 836
  year: 1991
  ident: 10.1016/j.ejor.2004.07.011_bib42
  article-title: Earliness–tardiness scheduling problems, I: weighted deviation of completion times about a common due date
  publication-title: Operations Research
  doi: 10.1287/opre.39.5.836
  contributor:
    fullname: Hall
– volume: 5
  start-page: 287
  year: 1979
  ident: 10.1016/j.ejor.2004.07.011_bib37
  article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey
  publication-title: Annals of Discrete Mathematics
  doi: 10.1016/S0167-5060(08)70356-X
  contributor:
    fullname: Graham
– volume: 6
  start-page: 311
  year: 2000
  ident: 10.1016/j.ejor.2004.07.011_bib61
  article-title: A simulated annealing approach to bicriteria scheduling problems on a single machine
  publication-title: Journal of Heuristics
  doi: 10.1023/A:1009622230725
  contributor:
    fullname: Karasakal
– volume: 12
  start-page: 258
  year: 1980
  ident: 10.1016/j.ejor.2004.07.011_bib105
  article-title: Two single machine sequencing problems involving controllable job processing times
  publication-title: AIIE Transactions
  doi: 10.1080/05695558008974515
  contributor:
    fullname: Vickson
– volume: 42
  start-page: 102
  year: 1994
  ident: 10.1016/j.ejor.2004.07.011_bib47
  article-title: New lower and upper bounds for scheduling around a small common due date
  publication-title: Operations Research
  doi: 10.1287/opre.42.1.102
  contributor:
    fullname: Hoogeveen
– volume: 94
  start-page: 361
  year: 2003
  ident: 10.1016/j.ejor.2004.07.011_bib48
  article-title: Preemptive scheduling with rejection
  publication-title: Mathematical Programming B
  doi: 10.1007/s10107-002-0324-z
  contributor:
    fullname: Hoogeveen
– volume: 292
  start-page: 145
  year: 2003
  ident: 10.1016/j.ejor.2004.07.011_bib20
  article-title: PERT scheduling with convex cost functions
  publication-title: Theoretical Computer Science
  doi: 10.1016/S0304-3975(01)00220-1
  contributor:
    fullname: Chrétienne
– volume: 21
  start-page: 115
  year: 1997
  ident: 10.1016/j.ejor.2004.07.011_bib95
  article-title: On the existence of schedules that are near-optimal for both makespan and total weighted completion time
  publication-title: Operations Research Letters
  doi: 10.1016/S0167-6377(97)00025-4
  contributor:
    fullname: Stein
– volume: 23
  start-page: 930
  year: 1998
  ident: 10.1016/j.ejor.2004.07.011_bib104
  article-title: Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
  publication-title: Mathematics of Operations Research
  doi: 10.1287/moor.23.4.930
  contributor:
    fullname: Verma
– volume: 124
  start-page: 117
  year: 2002
  ident: 10.1016/j.ejor.2004.07.011_bib96
  article-title: Finding the Pareto-optima for the total and maximum tardiness single machine problem
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/S0166-218X(01)00334-1
  contributor:
    fullname: Tadei
– volume: 25
  start-page: 31
  year: 1998
  ident: 10.1016/j.ejor.2004.07.011_bib102
  article-title: Bicriterion scheduling of identical processing time jobs by uniform processors
  publication-title: Computers & Operations Research
  doi: 10.1016/S0305-0548(97)00038-5
  contributor:
    fullname: Tuzikov
– volume: 107
  start-page: 414
  year: 1998
  ident: 10.1016/j.ejor.2004.07.011_bib88
  article-title: A bicriteria two machine permutation flowshop problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(97)00338-X
  contributor:
    fullname: Sivrikaya-Serifoglu
– ident: 10.1016/j.ejor.2004.07.011_bib13
  doi: 10.1002/nav.20000
– volume: 8
  start-page: 402
  year: 1996
  ident: 10.1016/j.ejor.2004.07.011_bib51
  article-title: A branch-and-bound algorithm for single-machine earliness–tardiness scheduling with idle time
  publication-title: INFORMS Journal on Computing
  doi: 10.1287/ijoc.8.4.402
  contributor:
    fullname: Hoogeveen
– year: 2002
  ident: 10.1016/j.ejor.2004.07.011_bib81
  contributor:
    fullname: Pinedo
– volume: 4
  start-page: 42
  year: 1980
  ident: 10.1016/j.ejor.2004.07.011_bib111
  article-title: Solving a bicriterion scheduling problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(80)90038-7
  contributor:
    fullname: Van Wassenhove
– ident: 10.1016/j.ejor.2004.07.011_bib58
– volume: 26
  start-page: 271
  year: 1990
  ident: 10.1016/j.ejor.2004.07.011_bib79
  article-title: A survey of results for sequencing problems with controllable processing times
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/0166-218X(90)90105-L
  contributor:
    fullname: Nowicki
– volume: vol. 1099
  start-page: 646
  year: 1996
  ident: 10.1016/j.ejor.2004.07.011_bib14
  article-title: Improved scheduling algorithms for minsum criteria
  contributor:
    fullname: Chakrabarti
– volume: 11
  start-page: 48
  year: 1982
  ident: 10.1016/j.ejor.2004.07.011_bib110
  article-title: A bicriterion approach to time/cost tradeoffs in sequencing
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(82)80008-8
  contributor:
    fullname: van Wassenhove
– volume: 43
  start-page: 871
  year: 1992
  ident: 10.1016/j.ejor.2004.07.011_bib82
  article-title: Two-stage flow shop scheduling problem with bicriteria
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/jors.1992.126
  contributor:
    fullname: Rajendran
– volume: 13
  start-page: 64
  year: 2000
  ident: 10.1016/j.ejor.2004.07.011_bib10
  article-title: Multiprocessor scheduling with rejection
  publication-title: SIAM Journal on Discrete Mathematics
  doi: 10.1137/S0895480196300522
  contributor:
    fullname: Bartal
– volume: 142
  start-page: 250
  year: 2002
  ident: 10.1016/j.ejor.2004.07.011_bib100
  article-title: An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(02)00265-5
  contributor:
    fullname: T’kindt
– volume: 29
  start-page: 41
  year: 2001
  ident: 10.1016/j.ejor.2004.07.011_bib113
  article-title: A 32-approximation algorithm for parallel machine scheduling with controllable processing times
  publication-title: Operations Research Letters
  doi: 10.1016/S0167-6377(01)00080-3
  contributor:
    fullname: Zhang
– volume: 44
  start-page: 115
  year: 1990
  ident: 10.1016/j.ejor.2004.07.011_bib22
  article-title: Scheduling identical jobs on uniform parallel machines
  publication-title: Statistica Neerlandica
  doi: 10.1111/j.1467-9574.1990.tb01276.x
  contributor:
    fullname: Dessouky
– volume: 22
  start-page: 585
  year: 1975
  ident: 10.1016/j.ejor.2004.07.011_bib25
  article-title: One machine sequencing to minimize mean flow time with minimum number of tardy
  publication-title: Naval Research Logistics Quarterly
  doi: 10.1002/nav.3800220314
  contributor:
    fullname: Emmons
– ident: 10.1016/j.ejor.2004.07.011_bib66
– volume: 21
  start-page: 846
  year: 1973
  ident: 10.1016/j.ejor.2004.07.011_bib55
  article-title: Minimizing average flow time with parallel machines
  publication-title: Operations Research
  doi: 10.1287/opre.21.3.846
  contributor:
    fullname: Horn
– ident: 10.1016/j.ejor.2004.07.011_bib69
– volume: 39
  start-page: 847
  year: 1991
  ident: 10.1016/j.ejor.2004.07.011_bib41
  article-title: Earliness–tardiness scheduling problems, II: Deviation of completion times about a common due date
  publication-title: Operations Research
  doi: 10.1287/opre.39.5.847
  contributor:
    fullname: Hall
– volume: 22
  start-page: 615
  year: 1975
  ident: 10.1016/j.ejor.2004.07.011_bib26
  article-title: A note on a scheduling problem with dual criteria
  publication-title: Naval Research Logistics Quarterly
  doi: 10.1002/nav.3800220317
  contributor:
    fullname: Emmons
– volume: 139
  start-page: 1
  year: 2002
  ident: 10.1016/j.ejor.2004.07.011_bib35
  article-title: A survey of the state-of-the-art of common due date assignment and scheduling research
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(01)00181-3
  contributor:
    fullname: Gordon
– volume: 18
  start-page: 314
  year: 1989
  ident: 10.1016/j.ejor.2004.07.011_bib71
  article-title: Minimizing schedule length subject to minimum flow time
  publication-title: SIAM Journal on Computing
  doi: 10.1137/0218022
  contributor:
    fullname: Leung
– volume: 15
  start-page: 483
  year: 1990
  ident: 10.1016/j.ejor.2004.07.011_bib23
  article-title: Minimizing total tardiness on one machine is NP-hard
  publication-title: Mathematics of Operations Research
  doi: 10.1287/moor.15.3.483
  contributor:
    fullname: Du
– volume: 28
  start-page: 643
  year: 1981
  ident: 10.1016/j.ejor.2004.07.011_bib60
  article-title: Minimizing the average deviation of job completion times about a common due date
  publication-title: Naval Research Logistics Quarterly
  doi: 10.1002/nav.3800280411
  contributor:
    fullname: Kanet
– volume: 15
  start-page: 277
  year: 1987
  ident: 10.1016/j.ejor.2004.07.011_bib31
  article-title: Single machine scheduling: A comparison of two solution procedures
  publication-title: Omega
  doi: 10.1016/0305-0483(87)90015-6
  contributor:
    fullname: Fry
– ident: 10.1016/j.ejor.2004.07.011_bib93
– volume: 17
  start-page: 1
  year: 1990
  ident: 10.1016/j.ejor.2004.07.011_bib15
  article-title: Scheduling unit processing time jobs on a single machine with multiple criteria
  publication-title: Computers and Operations Research
  doi: 10.1016/0305-0548(90)90022-Y
  contributor:
    fullname: Chen
– volume: 48
  start-page: 929
  year: 1997
  ident: 10.1016/j.ejor.2004.07.011_bib72
  article-title: Bicriterion scheduling in the two-machine flowshop
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/palgrave.jors.2600442
  contributor:
    fullname: Liao
– volume: 92
  start-page: 107
  year: 1999
  ident: 10.1016/j.ejor.2004.07.011_bib38
  article-title: Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
  publication-title: Annals of Operations Research
  doi: 10.1023/A:1018974428912
  contributor:
    fullname: Gupta
– volume: 13
  start-page: 330
  year: 1988
  ident: 10.1016/j.ejor.2004.07.011_bib33
  article-title: One-processor scheduling with symmetric earliness and tardiness penalties
  publication-title: Mathematics of Operations Research
  doi: 10.1287/moor.13.2.330
  contributor:
    fullname: Garey
– volume: 135
  start-page: 42
  year: 2001
  ident: 10.1016/j.ejor.2004.07.011_bib98
  article-title: An interactive algorithm to solve bicriteria scheduling problems on unrelated parallel machines
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(00)00288-5
  contributor:
    fullname: T’kindt
– volume: 19
  start-page: 237
  year: 1996
  ident: 10.1016/j.ejor.2004.07.011_bib18
  article-title: Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
  publication-title: Operations Research Letters
  doi: 10.1016/S0167-6377(96)00035-1
  contributor:
    fullname: Cheng
– volume: 52
  start-page: 253
  year: 1994
  ident: 10.1016/j.ejor.2004.07.011_bib73
  article-title: Two machine open shop scheduling problem with bi-criteria
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/0166-218X(94)90144-9
  contributor:
    fullname: Masuda
– ident: 10.1016/j.ejor.2004.07.011_bib44
– volume: 34
  start-page: 803
  year: 1987
  ident: 10.1016/j.ejor.2004.07.011_bib27
  article-title: Scheduling to a common due date on parallel uniform processors
  publication-title: Naval Research Logistics
  doi: 10.1002/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO;2-2
  contributor:
    fullname: Emmons
– volume: 21
  start-page: 100
  year: 1996
  ident: 10.1016/j.ejor.2004.07.011_bib45
  article-title: Minimizing maximum promptness and maximum lateness on a single machine
  publication-title: Mathematics of Operations Research
  doi: 10.1287/moor.21.1.100
  contributor:
    fullname: Hoogeveen
– volume: 94
  start-page: 284
  year: 1996
  ident: 10.1016/j.ejor.2004.07.011_bib59
  article-title: Single machine scheduling subject to deadlines and resource dependent processing times
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(96)00129-4
  contributor:
    fullname: Janiak
– volume: 33
  start-page: 227
  year: 1986
  ident: 10.1016/j.ejor.2004.07.011_bib7
  article-title: Minimizing mean absolute deviation of completion times about a common due date
  publication-title: Naval Research Logistics Quarterly
  doi: 10.1002/nav.3800330206
  contributor:
    fullname: Bagchi
– volume: 34
  start-page: 208
  year: 1988
  ident: 10.1016/j.ejor.2004.07.011_bib78
  article-title: A two-machine flow shop scheduling problem with controllable job processing times
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(88)90355-4
  contributor:
    fullname: Nowicki
– volume: 41
  start-page: 913
  year: 1994
  ident: 10.1016/j.ejor.2004.07.011_bib63
  article-title: Minimizing mean tardiness and earliness in single machine scheduling problems with unequal due dates
  publication-title: Naval Research Logistics
  doi: 10.1002/1520-6750(199412)41:7<913::AID-NAV3220410705>3.0.CO;2-A
  contributor:
    fullname: Kim
– volume: 30
  start-page: 505
  year: 2003
  ident: 10.1016/j.ejor.2004.07.011_bib99
  article-title: Two-machine flowshop with a secondary criterion
  publication-title: Computers & Operations Research
  doi: 10.1016/S0305-0548(02)00021-7
  contributor:
    fullname: T’kindt
– volume: 30
  start-page: 1268
  year: 1984
  ident: 10.1016/j.ejor.2004.07.011_bib29
  article-title: An overview of techniques for solving multiobjective mathematical programs
  publication-title: Management Science
  doi: 10.1287/mnsc.30.11.1268
  contributor:
    fullname: Evans
– volume: 17
  start-page: 595
  year: 1989
  ident: 10.1016/j.ejor.2004.07.011_bib30
  article-title: A framework for single machine multiple objective sequencing research
  publication-title: Omega
  doi: 10.1016/0305-0483(89)90063-7
  contributor:
    fullname: Fry
– volume: 40
  start-page: 85
  year: 1990
  ident: 10.1016/j.ejor.2004.07.011_bib21
  article-title: Multiobjective flow-shop scheduling
  publication-title: Naval Research Logistics
  contributor:
    fullname: Daniels
– volume: 17
  start-page: 381
  year: 1989
  ident: 10.1016/j.ejor.2004.07.011_bib6
  article-title: Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems
  publication-title: Operations Research
  contributor:
    fullname: Bagchi
– volume: 42
  start-page: 440
  year: 2004
  ident: 10.1016/j.ejor.2004.07.011_bib43
  article-title: Rescheduling for new orders
  publication-title: Operations Research
  doi: 10.1287/opre.1030.0101
  contributor:
    fullname: Hall
– volume: 16
  start-page: 198
  year: 2004
  ident: 10.1016/j.ejor.2004.07.011_bib92
  article-title: The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
  publication-title: INFORMS Journal on Computing
  doi: 10.1287/ijoc.1030.0034
  contributor:
    fullname: Sourd
– volume: 9
  start-page: 92
  year: 1997
  ident: 10.1016/j.ejor.2004.07.011_bib52
  article-title: Earliness–tardiness scheduling around almost equal due dates
  publication-title: INFORMS Journal on Computing
  doi: 10.1287/ijoc.9.1.92
  contributor:
    fullname: Hoogeveen
– volume: 41
  start-page: 797
  year: 1993
  ident: 10.1016/j.ejor.2004.07.011_bib24
  article-title: On the minimization of the makespan subject to flowtime optimality
  publication-title: Operations Research
  doi: 10.1287/opre.41.4.797
  contributor:
    fullname: Eck
– volume: 27
  start-page: 925
  year: 1979
  ident: 10.1016/j.ejor.2004.07.011_bib84
  article-title: Preemptive scheduling with due dates
  publication-title: Operations Research
  doi: 10.1287/opre.27.5.925
  contributor:
    fullname: Sahni
– volume: 7
  start-page: 63
  year: 1995
  ident: 10.1016/j.ejor.2004.07.011_bib74
  article-title: Scheduling n independent jobs on m uniform machines with both flowtime and makespan objectives: a parametric analysis
  publication-title: ORSA Journal on Computing
  doi: 10.1287/ijoc.7.1.63
  contributor:
    fullname: McCormick
– volume: 6
  start-page: 7
  year: 2003
  ident: 10.1016/j.ejor.2004.07.011_bib9
  article-title: A multiple-criterion model for machine scheduling
  publication-title: Journal of Scheduling
  doi: 10.1023/A:1022231419049
  contributor:
    fullname: Baker
– volume: 129
  start-page: 87
  year: 2001
  ident: 10.1016/j.ejor.2004.07.011_bib53
  article-title: Scheduling with target start times
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(99)00426-9
  contributor:
    fullname: Hoogeveen
– year: 2002
  ident: 10.1016/j.ejor.2004.07.011_bib97
  contributor:
    fullname: T’kindt
– volume: 70
  start-page: 115
  year: 1993
  ident: 10.1016/j.ejor.2004.07.011_bib16
  article-title: Complexity of single machine, multi-criteria scheduling problems
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(93)90236-G
  contributor:
    fullname: Chen
– volume: 45
  start-page: 1563
  year: 1966
  ident: 10.1016/j.ejor.2004.07.011_bib36
  article-title: Bounds for certain multiprocessor anomalies
  publication-title: Bell System Technical Journal
  doi: 10.1002/j.1538-7305.1966.tb01709.x
  contributor:
    fullname: Graham
– volume: 107
  start-page: 303
  year: 2001
  ident: 10.1016/j.ejor.2004.07.011_bib90
  article-title: Preemptive scheduling with two minimax criteria
  publication-title: Annals of Operations Research
  doi: 10.1023/A:1014971620268
  contributor:
    fullname: Sourd
– volume: 96
  start-page: 559
  year: 1997
  ident: 10.1016/j.ejor.2004.07.011_bib4
  article-title: A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(95)00363-0
  contributor:
    fullname: Alidaee
– volume: 46
  start-page: 259
  year: 1990
  ident: 10.1016/j.ejor.2004.07.011_bib70
  article-title: Approximation algorithms for scheduling unrelated parallel machines
  publication-title: Mathematical Programming
  doi: 10.1007/BF01585745
  contributor:
    fullname: Lenstra
– volume: 38
  start-page: 22
  year: 1990
  ident: 10.1016/j.ejor.2004.07.011_bib8
  article-title: Sequencing with earliness and tardiness penalties: A review
  publication-title: Operations Research
  doi: 10.1287/opre.38.1.22
  contributor:
    fullname: Baker
– year: 1990
  ident: 10.1016/j.ejor.2004.07.011_bib11
  contributor:
    fullname: Bazaraa
– volume: 55
  start-page: 237
  year: 1991
  ident: 10.1016/j.ejor.2004.07.011_bib49
  article-title: Scheduling around a small common due date
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(91)90228-N
  contributor:
    fullname: Hoogeveen
– volume: 1
  start-page: 59
  year: 1956
  ident: 10.1016/j.ejor.2004.07.011_bib89
  article-title: Various optimizers for single-stage production
  publication-title: Naval Research Logistics Quarterly
  doi: 10.1002/nav.3800030106
  contributor:
    fullname: Smith
– volume: 116
  start-page: 220
  year: 1999
  ident: 10.1016/j.ejor.2004.07.011_bib17
  article-title: A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(98)00136-2
  contributor:
    fullname: Chen
– ident: 10.1016/j.ejor.2004.07.011_bib56
– volume: 63
  start-page: 237
  year: 1995
  ident: 10.1016/j.ejor.2004.07.011_bib80
  article-title: A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/0166-218X(94)00071-5
  contributor:
    fullname: Nowicki
– ident: 10.1016/j.ejor.2004.07.011_bib83
– volume: 2
  start-page: 253
  year: 1999
  ident: 10.1016/j.ejor.2004.07.011_bib19
  article-title: Proportionate flow shops with controllable processing times
  publication-title: Journal of Scheduling
  doi: 10.1002/(SICI)1099-1425(199911/12)2:6<253::AID-JOS30>3.0.CO;2-R
  contributor:
    fullname: Cheng
– volume: 25
  start-page: 92
  year: 1976
  ident: 10.1016/j.ejor.2004.07.011_bib34
  article-title: Open shop scheduling to minimize finish time
  publication-title: Journal of the Association for Computing Machinery
  doi: 10.1145/322047.322055
  contributor:
    fullname: Gonzalez
– volume: 33
  start-page: 49
  year: 1986
  ident: 10.1016/j.ejor.2004.07.011_bib40
  article-title: Single-and multiple-processor models for minimizing completion time variance
  publication-title: Naval Research Logistics Quarterly
  doi: 10.1002/nav.3800330105
  contributor:
    fullname: Hall
– volume: 113
  start-page: 435
  year: 1999
  ident: 10.1016/j.ejor.2004.07.011_bib85
  article-title: A bicriteria approach to the two-machine flow shop scheduling problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(98)00009-5
  contributor:
    fullname: Sayin
– ident: 10.1016/j.ejor.2004.07.011_bib112
– volume: 32
  start-page: 464
  year: 1986
  ident: 10.1016/j.ejor.2004.07.011_bib77
  article-title: Scheduling with multiple performance measures: The one-machine case
  publication-title: Management Science
  doi: 10.1287/mnsc.32.4.464
  contributor:
    fullname: Nelson
– volume: 21
  start-page: 415
  year: 1996
  ident: 10.1016/j.ejor.2004.07.011_bib46
  article-title: Single-machine scheduling to minimize a function of two or three maximum cost criteria
  publication-title: Journal of Algorithms
  doi: 10.1006/jagm.1996.0051
  contributor:
    fullname: Hoogeveen
– volume: 27
  start-page: 15
  year: 2000
  ident: 10.1016/j.ejor.2004.07.011_bib65
  article-title: Open shop scheduling with makespan and total completion time criteria
  publication-title: Computers & Operations Research
  doi: 10.1016/S0305-0548(99)00005-2
  contributor:
    fullname: Kyparisis
– ident: 10.1016/j.ejor.2004.07.011_bib101
– volume: 70
  start-page: 335
  year: 1993
  ident: 10.1016/j.ejor.2004.07.011_bib3
  article-title: Two parallel machine sequencing problems involving controllable job processing times
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(93)90245-I
  contributor:
    fullname: Alidaee
– volume: 79
  start-page: 273
  year: 2001
  ident: 10.1016/j.ejor.2004.07.011_bib108
  article-title: Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard
  publication-title: Information Processing Letters
  doi: 10.1016/S0020-0190(01)00143-0
  contributor:
    fullname: Wan
– volume: 28
  start-page: 1155
  year: 1980
  ident: 10.1016/j.ejor.2004.07.011_bib106
  article-title: Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine
  publication-title: Operations Research
  doi: 10.1287/opre.28.5.1155
  contributor:
    fullname: Vickson
– volume: 27
  start-page: 250
  year: 1995
  ident: 10.1016/j.ejor.2004.07.011_bib103
  article-title: The single machine problem to minimize total tardiness subject to minimum number of tardy jobs
  publication-title: IIE Transactions
  doi: 10.1080/07408179508936738
  contributor:
    fullname: Vairaktarakis
– year: 1993
  ident: 10.1016/j.ejor.2004.07.011_bib2
  contributor:
    fullname: Ahuja
– volume: 30
  start-page: 192
  year: 1998
  ident: 10.1016/j.ejor.2004.07.011_bib64
  article-title: Minimizing flow time and maximum earliness on a single machine
  publication-title: IIE Transactions
  doi: 10.1080/07408179808966450
  contributor:
    fullname: Köksalan
– volume: 31
  start-page: 2279
  year: 2004
  ident: 10.1016/j.ejor.2004.07.011_bib86
  article-title: Minimizing the total weighted flow time in a single machine with controllable processing times
  publication-title: Computers & Operations Research
  doi: 10.1016/S0305-0548(03)00187-4
  contributor:
    fullname: Shabtay
– volume: 69
  start-page: 323
  year: 2001
  ident: 10.1016/j.ejor.2004.07.011_bib39
  article-title: Minimizing total flow time in a two-machine flowshop problem with minimum makespan
  publication-title: International Journal of Production Economics
  doi: 10.1016/S0925-5273(00)00039-6
  contributor:
    fullname: Gupta
– volume: 60–61
  start-page: 529
  year: 1999
  ident: 10.1016/j.ejor.2004.07.011_bib75
  article-title: Bi-criteria scheduling problem on three identical parallel machines
  publication-title: International Journal of Production Economics
  doi: 10.1016/S0925-5273(98)00166-2
  contributor:
    fullname: Mohri
– ident: 10.1016/j.ejor.2004.07.011_bib12
– volume: 142
  start-page: 271
  year: 2002
  ident: 10.1016/j.ejor.2004.07.011_bib107
  article-title: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(01)00302-2
  contributor:
    fullname: Wan
– volume: 1
  start-page: 117
  year: 1976
  ident: 10.1016/j.ejor.2004.07.011_bib32
  article-title: The complexity of flowshop and jobshop scheduling
  publication-title: Mathematics of Operations Research
  doi: 10.1287/moor.1.2.117
  contributor:
    fullname: Garey
– volume: 49
  start-page: 175
  year: 2003
  ident: 10.1016/j.ejor.2004.07.011_bib28
  article-title: Techniques for scheduling with rejection
  publication-title: Journal of Algorithms
  doi: 10.1016/S0196-6774(03)00078-6
  contributor:
    fullname: Engels
– volume: 25
  start-page: 612
  year: 1978
  ident: 10.1016/j.ejor.2004.07.011_bib67
  article-title: On preemptive scheduling of unrelated parallel machines with linear programming
  publication-title: Journal of the Association of Computing Machinery
  doi: 10.1145/322092.322101
  contributor:
    fullname: Lawler
– volume: 10
  start-page: 253
  year: 1983
  ident: 10.1016/j.ejor.2004.07.011_bib87
  article-title: Scheduling jobs on one machine to minimize the maximum tardiness with minimum number of tardy
  publication-title: Computers & Operations Research
  doi: 10.1016/0305-0548(83)90018-7
  contributor:
    fullname: Shanthikumar
– ident: 10.1016/j.ejor.2004.07.011_bib5
– volume: 6
  start-page: 153
  year: 1981
  ident: 10.1016/j.ejor.2004.07.011_bib68
  article-title: Minimizing maximum lateness in a two-machine open shop
  publication-title: Mathematics of Operations Research
  doi: 10.1287/moor.6.1.153
  contributor:
    fullname: Lawler
– volume: 14
  start-page: 37
  year: 2002
  ident: 10.1016/j.ejor.2004.07.011_bib109
  article-title: Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem
  publication-title: INFORMS Journal on Computing
  doi: 10.1287/ijoc.14.1.37.7706
  contributor:
    fullname: Van den Akker
– volume: 15
  start-page: 1119
  year: 1986
  ident: 10.1016/j.ejor.2004.07.011_bib62
  article-title: Worst case bound of an LRF schedule for the mean weighted flow time problem
  publication-title: SIAM Journal on Computing
  doi: 10.1137/0215081
  contributor:
    fullname: Kawaguchi
– volume: 6
  start-page: 533
  year: 2003
  ident: 10.1016/j.ejor.2004.07.011_bib94
  article-title: The one machine problem with earliness and tardiness penalties
  publication-title: Journal of Scheduling
  doi: 10.1023/A:1026224610295
  contributor:
    fullname: Sourd
– volume: 17
  start-page: 205
  year: 1995
  ident: 10.1016/j.ejor.2004.07.011_bib50
  article-title: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
  publication-title: Operations Research Letters
  doi: 10.1016/0167-6377(95)00023-D
  contributor:
    fullname: Hoogeveen
– ident: 10.1016/j.ejor.2004.07.011_bib57
– ident: 10.1016/j.ejor.2004.07.011_bib91
SSID ssj0001515
Score 2.385761
Snippet In this paper we give a survey of the most important results on multicriteria scheduling that have appeared in the literature or are to appear. We provide an...
SourceID crossref
repec
pascalfrancis
elsevier
SourceType Aggregation Database
Index Database
Publisher
StartPage 592
SubjectTerms Applied sciences
Controllable processing times
Earliness-tardiness
Exact sciences and technology
Machine scheduling
Multicriteria
Operational research and scientific management
Operational research. Management science
Pareto optimal
Scheduling, sequencing
Simultaneous approximation
Title Multicriteria scheduling
URI https://dx.doi.org/10.1016/j.ejor.2004.07.011
http://econpapers.repec.org/article/eeeejores/v_3a167_3ay_3a2005_3ai_3a3_3ap_3a592-623.htm
Volume 167
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NS8MwFH_MCaKIH1PZ_Bg7eJO4pvnqjmNTpsNddLBbSNsUJziLTsGLf7sv_ZjbQQ8WXkpbkoZfk_demvcBcM6VSZihMaEJDQkXYUg6fiAJroWYlV5i_WwH_24kB2N-OxGTCvRKXxhnVlnw_pynZ9y6uNMu0Gyn02n73mOoGaJGnQ1DGeC6fR3FEedVWO_eDAejBUN2MjvbTFCKuAqF70xu5mWfXrKwoDyL4Unpb_JpOzVviFqSp7tAVfbVpjZakkXXe7BTKJGtbt7PfajYWQ02Shv2GuyWuRpaxdStwdZS4MEDqGd-t8gwXKRm08IVLkoc55h-COPrq4fegBQ5EkjEhT8ngtk4Zn4kwgARD5OIiTiQYaKssJGIY2NYEEpKFZbCi6lB-a4CyiIhjQ1QuzuC6uxlZuvQotx3kX5MonzGObcB7xhmothzc1olXgMuSmR0mofC0KWN2JN2OLqcllx7SiOODRAleHrlg2rk1X_Wa64g_fMq5E2CS96Afgb94oHFAxuxb_pD47CTCstPJPe_DE9TJIaUIomOr1Hf04_z5-N_9u8ENvPorT6h8hSq89d3e4Z6yTxswtrlF20Wow-v-sObb-4t35Q
link.rule.ids 315,786,790,4028,4521,24144,27955,27956,45618,45712
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1JS8NAFH5ICy6IS1Va1x68ydDMnh5FLXXrxRZ6GybJBCtYQ1sF_71vsrgc9GDgTSBhkuHLzFsybwE4Fdqm3NKE0JRGRMgoIl0WKoK2EHcqSB3Ld_DvB6o_EjdjOV6CiyoWxrtVlry_4Ok5ty6vdEo0O9lk0nkIOGqGqFHn01CFaLfXhdSU1aB-fn3bH3wyZC-z880ErYnvUMbOFG5e7uklTwsq8hyelP4mn9YzO0fU0qLcBaqyM5e5-Jss6m3BRqlEts-LcW7Dkps2YLnyYW_AZlWroV0u3QasfUs8uAPNPO4WGYbP1GzbaOGixPGB6bsw6l0NL_qkrJFAYiHZgkjukoSzWEYhIh6lMZdJqKJUO-limSTW8jBSlGpsZZBQi_Jdh5THUlkXona3B7Xpy9Q1oU0F85l-bKoZF0K4UHQtt3ES-DWt06AFZxUyJitSYZjKR-zJeBx9TUthAm0QxxbICjzz44Ma5NV_9jv-gfTXq5A3SaFECy5z6D9vODzwIW5u3gxOO6WxfUfy_8vwNEHiSBmS7DKD-p55XDzv_3N8J7DSH97fmbvrwe0BrBaZXBmh6hBqi9mrO0IdZREdl3PwAw7g4Is
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=Multicriteria+scheduling&rft.jtitle=European+journal+of+operational+research&rft.au=Hoogeveen%2C+Han&rft.date=2005-12-16&rft.issn=0377-2217&rft.volume=167&rft.issue=3&rft.spage=592&rft.epage=623&rft_id=info:doi/10.1016%2Fj.ejor.2004.07.011&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2004_07_011
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon