Partial enumeration in heuristics for some combinatorial optimization problems

Journal of the Operational Research Society

Volumn 58, Issue 1, 2007, Pages 73-79

  Volgenant, A ^a   Zwiers, I Y ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Generalized knapsack problem; Heuristics; Partial enumeration; Scheduling; Single machine weighted tardiness

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTING TIME; PARTIAL ENUMERATION; SINGLE MACHINE WEIGHTED TARDINESS PROBLEM;

HEURISTIC METHODS;

EID: 33845542375     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602102     Document Type: Article

References (16)

1. Abdul-Razaq TS, Potts CN and van Wassenhove LN (1990). A survey of algorithms for the single machine weighted tardiness scheduling problem. DM Appl Math 26: 235-253.
2. Argüello MF, Feo TA and Goldschmidt O (1996). Randomized methods for the number partitioning problem. Comput Opns Res 23: 103-111.
3. Benati S (1997). An algorithm for a cutting stock problem on a strip. J Opl Res Soc 48: 288-294.
4. Chu PC and Beasley JE (1998). A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4: 63-86.
5. Fréville A (2004). The multidimensional 0-1 knapsack problem: an overview. Eur J Opl Res 155: 1-21.
6. Grosso A, Della Croce F and Tadei R (2004). An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Opns Res Lett 32: 68-72.
7. Holthaus O and Rajendran C (2005). A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs. J Opl Res Soc 56: 947-953.
8. Loulou R and Michaelides E (1979). New greedy-like heuristics for the multi-dimensional 0-1 knapsack problem. Opns Res 27: 1101-1114.
9. Magazine MJ and Oguz O (1984). A heuristic algorithm for the multidimensional zero-one knapsack problem. Eur J Opl Res 16: 319-326.
10. Mokotoff E and Jimeno JL (2002). Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem. Ann Opns Res 117: 133-150.
11. Potts CN and van Wassenhove LN (1985). A branch and bound algorithm for the total weighted tardiness problem. Opns Res 33: 363-377.
12. Rachamadugu RV and Morton TE (1981). Myopic heuristics for the single machine weighted tardiness problem. Working Paper 30-82-83, GSIA, Carnegie Mellon University, Pittsburgh, PA.
13. Rios-Mercado RZ and Bard JF (1999). A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times. IIE Trans 31: 721-731.
14. Vasquez M and Vimont Y (2005). Improved results on the 0-1 multidimensional knapsack problem. Eur J Opl Res 165: 70-81.
15. Volgenant A and Teerhuis E (1999). Improved heuristics for the n-job single-machine weighted tardiness problem. Comput Opns Res 26: 35-44.
16. Volgenant A and Zoon JA (1990). An improved heuristic for multidimensional 0-1 knapsack problems. J Opl Res Soc 41: 963-970.