Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
Motivated by just-in-time manufacturing, we consider a single machine scheduling problem with dual criteria, i.e., the minimization of the total weighted earliness subject to minimum number of tardy jobs. We discuss several dominance properties of optimal solutions. We then develop a heuristic algorithm with time complexity O(n3) and a branch and bound algorithm to solve the problem. The computational experiments show that the heuristic algorithm is effective in terms of solution quality in many instances while the branch and bound algorithm is efficient for medium-size problems.
Year of publication: |
2009
|
---|---|
Authors: | Wan, Guohua ; Yen, Benjamin P.-C. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 195.2009, 1, p. 89-97
|
Publisher: |
Elsevier |
Keywords: | Scheduling Single machine Dual criteria Earliness Number of tardy jobs |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Wan, Guohua, (2002)
-
Wan, Guohua, (2009)
-
Analysis of evaluation models for websites
Yen, Benjamin P.-C., (2005)
- More ...