New insights on the single machine total tardiness problem
نویسندگان
چکیده
منابع مشابه
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.
متن کامل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...
متن کاملA hybrid algorithm for the single-machine total tardiness problem
We propose a hybrid algorithm based on the Ant Colony Optimization (ACO) meta-heuristic, in conjunction with four well-known elimination rules, to tackle the NP -hard single-machine scheduling problem to minimize the total job tardiness. The hybrid algorithm has the same running time as that of ACO. We conducted extensive computational experiments to test the performance of the hybrid algorithm...
متن کاملThe single-machine total tardiness scheduling problem: Review and extensions
0377-2217/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.ejor.2009.04.007 * Tel.: +1 305 348 3309; fax: +1 305 348 4126. E-mail address: [email protected] We review the latest theoretical developments for the single-machine total tardiness 1== T scheduling problem and propose extensions to some of them. We also review (and in some cases extend) exact algorithms, fully polynomial time appr...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 1997
ISSN: 0160-5682
DOI: 10.1038/sj.jors.2600321