A fast parallel dynasearch algorithm for some scheduling problems

PARELEC 2006 - Proceedings: International Symposium on Parallel Computing in Electrical Engineering

Volumn , Issue , 2006, Pages 275-280

  Bozejko, Wojciech ^a   Wodecki, Mieczysław ^b  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

MAINFRAME COMPUTER; POLYNOMIAL-TIME; SCHEDULING PROBLEM; SINGLE MACHINE TOTAL WEIGHTED TARDINESS PROBLEM; SWAP MOVES;

DYNAMIC PROGRAMMING; ELECTRICAL ENGINEERING; HEURISTIC METHODS; PARALLEL ARCHITECTURES; POLYNOMIAL APPROXIMATION;

SCHEDULING ALGORITHMS;

EID: 45749083653     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PARELEC.2006.3     Document Type: Conference Paper

References (13)

1. T.S. Abdul-Razaq, C.N. Potts, L.N. Van Wassenhove, A survey of algorithms for the single machine total weighted tardiness scheduling problem, Discrete Applied Mathematics, 26, 1990, 235-253.
2. Beasley J.E., OR-Library: distributing test problems by electronic mail, Journal of the Operational Research Society 41, 1990, 1069-1072.
3. Congram K.R., C.N. Potas, S. Van de Velde, An interated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem, INFORMS Journal on Computing, 14, 2002, 52-67.
4. Crauwels H.A.J., Potts C.N., Van Wassenhove L.N., Local Search Heuristics for the Single machine Total Weighted Tardiness Scheduling Problem, INFORMS Journal on Computing, Vol. 10, No. 3, 1998, 341-350. (Pubitemid 128669139)
5. Den Basten, M., T. Stützle, M. Dorigo, Design of Iterated Local Search Algoritms An Example Application to the Single Machine Total Weighted Tardiness Problem, J.W.Boers et al. (eds.) EvoWorskshop 2001, LNCS 2037, 2001, 441-451.
6. H. Emmons, One machine sequencing to Minimize Certain Functions of Job Tardiness, Operations Research, 17, 1969, 701-715.
7. M.L. Fisher, A Dual Algorithm for the One Machine Scheduling Problem, Mathematical Programming, 11, 1976, 229-252.
8. Grosso A., F. Della Croce, R. Tadei, An enhanced dynasearch neighborhood for the single-machine total weighter tardiness scheduling problem, Operations Research Letters, 32, 2004, 68-72.
9. Graham M.R., E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, Optimization an approximation in detrministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, 3, 1979, 287-326.
10. Lawler, E.L., A pseudopolynomial Algorithm for Sequencing Jobs to Minimize Total Tardiness, Annals of Discrete Mathematics, 1, 1977, 331-342.
11. Lenstra, J.K., Rinnoy Kan, A.G.H., and P.Brucker, Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics, 1, 1977, 343-362.
12. Potts C.N., Van Wassenhowe L.N., Single Machine Tardiness Sequencing Heuristics, IIE Transactions, 23, 1991, 346-354.
13. C.N. Potts, C.N. Van Wassenhove, A Branch and Bound Algorithm for the Total Weighted Tardiness Problem, Operations Research, 33, 1985, 177-181.