.
Mathematica Applicanda (1999)
- Volume: 27, Issue: 41
- ISSN: 1730-2668
Access Full Article
topAbstract
topHow to cite
topMieczysław Wodecki. ".." Mathematica Applicanda 27.41 (1999): null. <http://eudml.org/doc/293106>.
@article{MieczysławWodecki1999,
abstract = {Heuristics algorithms for the single machine total tardiness problem. This paper presents approximations algorithms for the single machine total weighted tardiness problems. The algorithms is based on a tabu search technique with a specific neighborhood definition. Results of testing the algorithms on large number of randomly generated examples are also given and analysed.},
author = {Mieczysław Wodecki},
journal = {Mathematica Applicanda},
keywords = {Scheduling theory, deterministic; Programming involving graphs or networks},
language = {eng},
number = {41},
pages = {null},
title = {.},
url = {http://eudml.org/doc/293106},
volume = {27},
year = {1999},
}
TY - JOUR
AU - Mieczysław Wodecki
TI - .
JO - Mathematica Applicanda
PY - 1999
VL - 27
IS - 41
SP - null
AB - Heuristics algorithms for the single machine total tardiness problem. This paper presents approximations algorithms for the single machine total weighted tardiness problems. The algorithms is based on a tabu search technique with a specific neighborhood definition. Results of testing the algorithms on large number of randomly generated examples are also given and analysed.
LA - eng
KW - Scheduling theory, deterministic; Programming involving graphs or networks
UR - http://eudml.org/doc/293106
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.