Average and worst-case analysis of heuristics for the maximum tardiness problem
Hall, N.G.; Rhee, W.T.
European Journal of Operational Research 26(2): 272-277
1986
ISSN/ISBN: 0377-2217 Accession: 074194881
PDF emailed within 1 workday: $29.90
Related References
Shiwei, C.H.A.N.G.; Hirofumi, M.A.T.S.U.O.; Guochun, T.A.N.G. 1990: Worst-case analysis of local search heuristics for the one-machine total tardiness problem Naval Research Logistics 37(1): 111-121Hoon Liong, O.N.G.; Moore, J.B. 1985: Worst-case analysis of some heuristics for the m-Salesmen problem Material Flow 2(1): 203-209
Marchetti Spaccamela, A.; Pelaggi, A. 1987: Worst case analysis of two heuristics for the set partitioning problem Informatique Theorique et Applications (Imprime) 21(1): 11-23
Joneja, D. 1990: The joint replenishment problem : new heuristics and worst case performance bounds Operations Research 38(4): 711-723
Voss, S. 1993: Worst-case performance of some heuristics for Steiner's problem in directed graphs Information Processing Letters 48(2): 99-105
Bottcher, A.; Lawitzky, G.; Simon, H.U. 1988: Worst-case analysis of heuristics for the local microcode, optimization problem Operations Research Letters 7(3): 127-130
Gregorin, L.; Givigi, S.N.; Freire, E.; Carvalho, E.; Molina, L. 2017: Heuristics for the Multi-Robot Worst-Case Pursuit-Evasion Problem IEEE Access 5: 17552-17566
Anily, S.; Bramel, J.; Simchilevi, D. 1994: Worst-case analysis of heuristics for the bin packing problem with general cost structures Operations Research 42(2): 287-298
Warburton, A.R. 1993: Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem Operations Research Letters 13(1): 37-42
Solomon, M.M. 1986: On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints Networks (New York) 16(2): 161-174
De Souza, C.C.; Ribeiro, C.C. 1990: A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear steiner tree problem Operations-Research-Spektrum 12(2): 109-111
Huo, J.; Hou, Y.; Chu, F.; He, J. 2019: A Combined Average-Case and Worst-Case Analysis for an Integrated Hub Location and Revenue Management Problem Discrete Dynamics in Nature and Society 2019: 1-13
Fathi, Y.; Nuttle, H.W.L. 1990: Heuristics for the common due date weighted tardiness problem Iie Transactions 22(3): 215-225
Yoon, S.H.; Lee, I.S. 2011: New constructive heuristics for the total weighted tardiness problem The Journal of the Operational Research Society 62(1): 232-237
Volgenant, A.; Teerhuis, E. 1999: Improved heuristics for the n-job single-machine weighted tardiness problem Computers and Operations Research 26(1): 35-44
Russell, R.M.; Holsenback, J. 1997: Evaluation of leading heuristics for the single machine tardiness problem European Journal of Operational Research 96(3): 538-545
Huegler, P.A.; Vasko, F.J. 1997: A performance comparison of heuristics for the total weighted tardiness problem Computers and Industrial Engineering 32(4): 753-767
Valente, J.M.S.; Alves, R.A.F.S. 2008: Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties Computers and Operations Research 35(11): 3696-3713
Fernandez-Viagas, V.; Framinan, J.M. 2015: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness Computers-Operations Research 60: 27-36
Valente, J.M.S.; Schaller, J.E. 2012: Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem Computers and Operations Research 39(9): 2223-2231