Name
Title | ||
|---|---|---|
A heuristic algorithm for minimizing total absolute deviation from distinct due dates on a single machine |
Abstract | ||
|---|---|---|
In this paper, we present a heuristic algorithm for minimizing total absolute deviation from distinct due dates on a single machine. First, several dominance properties related are established using proof by adjacent pairwise interchanges. Then, a detailed procedure of the proposed algorithm is given. The proposed algorithm is tested on a set of randomly generated problem instances. Results of numerical experiments show that the heuristic algorithm is computationally efficient, and it can obtain a good enough solution within an acceptable time. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/CoASE.2013.6653966 | CASE |
Keywords | Field | DocType |
dominance properties,adjacent pairwise interchange,tardiness,adjacent pairwise interchanges,heuristic algorithm,single machine scheduling,distinct due dates,single machine,earliness,total absolute deviation minimization | Pairwise comparison,Mathematical optimization,Single-machine scheduling,Heuristic (computer science),Absolute deviation,Mathematics | Conference |
Volume | Issue | ISSN |
null | null | 2161-8070 |
Citations | PageRank | References |
1 | 0.36 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| You Li | 1 | 5 | 4.64 |
| Z. B. Jiang | 2 | 242 | 36.08 |
| Wenyou Jia | 3 | 8 | 2.71 |