Paper Info
Title
An efficient genetic algorithm for job shop scheduling with tardiness objectives
Abstract
We consider job shop scheduling problems with release and due-dates, as well as various tardiness objectives. To date, no efficient general-purpose heuristics have been developed for these problems. genetic algorithms can be applied almost directly, but come along with apparent weaknesses. We show that a heuristic reduction of the search space can help the algorithm to find better solutions in a shorter computation time. Two ways of reducing a search space are investigated by considering short-term decisions made at the machine level and by long-term decisions made at the shop floor level.
Year
DOI
Venue
2004
10.1016/S0377-2217(03)00016-X
European Journal of Operational Research
Keywords
Field
DocType
Genetic algorithm,Job shop scheduling,Tardiness objectives,Tunable schedule builder,Multi-stage decomposition
Mathematical optimization,Heuristic,Job shop scheduling,Tardiness,Computer science,Flow shop scheduling,Heuristics,Rate-monotonic scheduling,Genetic algorithm,Operations management,Computation
Journal
Volume
Issue
ISSN
155
3
0377-2217
Citations 
PageRank 
References 
58
2.97
12
Authors
2
Name
Order
Citations
PageRank
Dirk C. Mattfeld128326.47
Christian Bierwirth258638.75