Release Time:2019-03-09  Hits:

Indexed by: Journal Article

Date of Publication: 2010-06-01

Journal: APPLIED SOFT COMPUTING

Included Journals: Scopus、EI、SCIE

Volume: 10

Issue: 3

Page Number: 849-858

ISSN: 1568-4946

Key Words: Fuzzy scheduling; Due date assignment; Earliness-tardiness costs; Possibilistic theory; Customer service level

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. (C) 2009 Elsevier B. V. All rights reserved.