Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
497188 | Applied Soft Computing | 2010 | 10 Pages |
Abstract
Due date assignment scheduling problems with deterministic and stochastic parameters have been studied extensively in recent years. In this paper, we consider a single machine due date assignment scheduling problem with uncertain processing times and general precedence constraint among the jobs. The processing times of the jobs are assumed to be fuzzy numbers. We first propose an optimal polynomial time algorithm for the problem without precedence constraints among jobs. Then, we show that if general precedence constraint is involved, the problem is NP-hard. Finally, we show that if the precedence constraint is a tree or a collection of trees, the problem is still polynomially solvable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Jinquan Li, Kaibiao Sun, Dehua Xu, Hongxing Li,