.png){kind=icon}
Return
A tabu search algorithm for parallel machine total tardiness problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(02)00198-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this study, we consider the problem of scheduling a set of independent jobs with sequence dependent setups on a set of uniform parallel machines such that total tardiness is minimized. Jobs have non-identical due dates and arrival times. A tabu search (TS) approach is employed to attack this complex problem. In order to obtain a robust search mechanism, several key components of TS such as candidate list strategies, tabu classifications, tabu tenure and intensification/diversification strategies are investigated. Alternative approaches to each of these issues are developed and extensively tested on a set of problems obtained from the literature. The results obtained are considerably better than those reported previously and constitute the best solutions known for the benchmark problems as to date.
Keywords:
scheduling
parallel machines
total tardiness problem
sequence dependent setup times
tabu search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
A Randomized Trial Comparing a Brief Meditation Retreat to a Vacation: Effects on Daily Well-Being
PREAI
ShareSave
ShareSaveShareSave
View more