Mixed Dispatch Rule for Single Machine Total Weighted Tardiness Problem
نویسندگان
چکیده
منابع مشابه
New Instances for the Single Machine Total Weighted Tardiness Problem
Previous research in the single machine total weighted tardiness problem (SMTWTP) has led to the proposition of effective local search strategies. At least existing benchmark instances from the literature do not pose a challenge for state-of-the-art algorithms. This paper describes the proposition of two classes of novel instances for the single machine total weighted tardiness problem. In resp...
متن کاملSingle .machine Total Weighted Tardiness with Release Dates Single Machine Total Weighted Tardiness with Release Dates
The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...
متن کاملMinimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملOn the single machine total tardiness problem
In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates. 2004 Published by Elsevier B.V.
متن کاملThe Single Machine Total Weighted Tardiness Problem - Is it (for Metaheuristics) a Solved Problem ?
The single machine total weighted tardiness problem (SMTWTP) is a well-known planning problem from operations research, engineering and computer science. It is characterized by the assignment of starting times for a given set of jobs on a single processor, minimizing the (weighted) tardy completion of the jobs with respect to given due dates. In this sense, the tardiness is given an economical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2013
ISSN: 1812-5654
DOI: 10.3923/jas.2013.4616.4619