Entry Martin:1996:NAC from lncs1996a.bib
Last update: Mon Mar 13 02:22:27 MDT 2017
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Martin:1996:NAC,
author = "P. Martin and D. B. Shmoys",
title = "A New Approach to Computing Optimal Schedules for the
Job-Shop Scheduling Problem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1084",
pages = "389--??",
year = "1996",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Aug 14 09:38:08 MDT 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs1996a.bib",
acknowledgement = ack-nhfb,
}
Related entries
- approach,
1030(0)30,
1030(0)117,
1030(0)459,
1031(0)4,
1031(0)217,
1035(0)71,
1035(0)81,
1035(0)201,
1036(0)47,
1037(0)127,
1037(0)331,
1038(0)100,
1040(0)1,
1040(0)61,
1040(0)117,
1040(0)203,
1040(0)385,
1041(0)257,
1041(0)408,
1043(0)238,
1044(0)81,
1046(0)441,
1048(0)61,
1048(0)174,
1050(0)237,
1050(0)273,
1051(0)347,
1051(0)576,
1051(0)609,
1054(0)248,
1057(0)147,
1057(0)364,
1058(0)280,
1060(0)326,
1063(0)220,
1064(0)127,
1064(0)439,
1064(0)630,
1065(0)347,
1066(0)1,
1066(0)464,
1066(0)485,
1066(0)553,
1066(0)563,
1067(0)571,
1067(0)607,
1069(0)77,
1069(0)106,
1069(0)191,
1069(0)206,
1072(0)13,
1072(0)92,
1072(0)190,
1072(0)233,
1072(0)260,
1073(0)1,
1073(0)27,
1075(0)39,
1075(0)141,
1075(0)186,
1076(0)195,
1078(0)64,
1078(0)88,
1078(0)140,
1079(0)315,
1079(0)325,
1079(0)335,
1079(0)428,
1079(0)541,
1080(0)193,
1081(0)146,
1081(0)271,
1082(0)83,
1084(0)445,
1086(0)75,
1086(0)177,
1086(0)401,
1086(0)512,
1086(0)623,
1088(0)89,
1088(0)171,
1090(0)68,
1091(0)192,
1091(0)346,
1093(0)164
- computing,
1030(0)137,
1030(0)253,
1030(0)417,
1030(0)494,
1033(0)534,
1039(0)159,
1041(0)177,
1041(0)345,
1046(0)3,
1046(0)193,
1046(0)269,
1049(0)76,
1059(0)165,
1063(0)181,
1064(0)399,
1065(0)696,
1066(0)485,
1067(0)106,
1067(0)128,
1067(0)251,
1067(0)413,
1067(0)508,
1067(0)514,
1067(0)869,
1067(0)880,
1068(0)217,
1075(0)64,
1082(0)103,
1086(0)234,
1090(0)352,
1097(0)124
- new,
1027(0)28,
1027(0)234,
1029(0)105,
1029(0)244,
1033(0)450,
1039(0)89,
1039(0)205,
1046(0)3,
1050(0)209,
1051(0)140,
1051(0)160,
1054(0)248,
1058(0)280,
1060(0)192,
1062(0)197,
1063(0)120,
1063(0)273,
1066(0)553,
1067(0)571,
1067(0)792,
1070(0)33,
1070(0)166,
1070(0)294,
1070(0)372,
1075(0)141,
1075(0)234,
1077(0)17,
1077(0)193,
1077(0)246,
1081(0)14,
1086(0)448,
1091(0)327,
1094(0)124,
1099(0)324
- Optimal,
1027(0)64,
1046(0)157,
1046(0)319,
1046(0)363,
1046(0)503,
1046(0)655,
1057(0)241,
1060(0)294,
1064(0)283,
1066(0)244,
1084(0)31,
1084(0)404,
1090(0)169,
1090(0)290,
1097(0)212,
1097(0)246,
1097(0)333,
1099(0)244,
1099(0)550
- problem,
1031(0)139,
1031(0)298,
1033(0)551,
1035(0)149,
1035(0)509,
1036(0)17,
1046(0)39,
1046(0)99,
1048(0)33,
1048(0)189,
1054(0)1,
1054(0)7,
1054(0)115,
1054(0)232,
1058(0)1,
1061(0)357,
1063(0)120,
1063(0)247,
1063(0)320,
1063(0)333,
1067(0)60,
1067(0)429,
1067(0)447,
1067(0)467,
1067(0)633,
1069(0)40,
1069(0)106,
1073(0)155,
1073(0)211,
1074(0)109,
1075(0)87,
1075(0)304,
1075(0)361,
1076(0)354,
1079(0)325,
1081(0)14,
1081(0)69,
1081(0)362,
1084(0)58,
1084(0)72,
1084(0)85,
1084(0)147,
1084(0)204,
1084(0)249,
1084(0)316,
1084(0)359,
1084(0)445,
1086(0)29,
1086(0)234,
1086(0)353,
1086(0)466,
1086(0)475,
1086(0)550,
1086(0)605,
1087(0)1,
1087(0)174,
1088(0)147,
1090(0)21,
1090(0)68,
1090(0)241,
1090(0)250,
1090(0)310,
1090(0)333,
1091(0)1,
1092(0)266,
1097(0)28,
1097(0)66,
1097(0)76,
1097(0)100,
1097(0)112,
1097(0)149,
1097(0)161,
1099(0)268,
1099(0)466,
1099(0)562,
1099(0)610
- Schedules,
1046(0)655,
1057(0)241,
1076(0)306
- scheduling,
1030(0)511,
1033(0)31,
1038(0)177,
1044(0)39,
1045(0)211,
1051(0)327,
1051(0)445,
1060(0)18,
1063(0)345,
1069(0)191,
1079(0)325,
1084(0)288,
1084(0)301,
1084(0)404,
1099(0)646
- Shmoys, D. B.,
1099(0)646