Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481682 | European Journal of Operational Research | 2009 | 9 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Guohua Wan, Benjamin P.-C. Yen,