Short CommunicationA multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
Introduction
In this paper we evaluate the performance of dynasearch in the context of time-dependent scheduling. Dynasearch is a recently proposed neighborhood search technique [6] that allows a series of moves to be performed at each iteration of a local search algorithm, generating in that way an exponential size neighborhood. In order to efficiently explore such a neighborhood, dynasearch uses dynamic programming. Congram et al. applied dynasearch to the classical single machine total weighted tardiness problem (1∥∑wjTj) [6] and compared the quality of the obtained solutions with traditional multi-start and iterated descent algorithms. The obtained computational results were very encouraging in the case where dynasearch was applied inside an iterated local search algorithm when compared to classical iterated descent algorithms. However, the application of dynasearch in the case of a multi-start algorithm gave marginally better results than the classical multi-start methods. It is then natural to ask if dynasearch is not so appropriate for multi-start local search algorithms. In this work, we show that this is not true. More precisely, we study the time dependent version of the single machine total weighted tardiness problem, and we present computation results showing that multi-start dynasearch clearly dominates the classical multi-start local search algorithms.
In scheduling theory there have been an increasing interest, in the last few years, for scheduling problems with time-dependent processing times [2]. In this paper we consider a general time-dependent version of the well known single-machine total weighted tardiness scheduling problem. The problem can be stated as follows. We are given a set of n jobs, each job j has a due date dj and a positive weight wj. The processing time fj(t) of each job j depends on its starting time of execution t and is given by a function fj. We shall denote fj(t) by pjt. So, if a job j immediately starts after a job i, its duration is pjCi, where Ci represents the completion time of job i. We shall consider only the idleness version (it means that we do not allow idle times between jobs, i.e. each job starts immediately after the previous one has terminated, and therefore the solution we seek is a permutation of the jobs), and consider that all values are integer ones.
Since we make no assumptions on the functions fj, this model captures a wide range of practical applications. A first example of applications is when the availability of the resources (e.g. processing power) vary (e.g. in a monotone or cyclic way) over time; think for example at the load of a computer network. A second example of applications is when any delay in the execution of a job may lead to an increase (resp. decrease) of the difficulty of the job and therefore to a modified duration; think for example to fire fighting (resp. destroying a target which is getting closer).
We denote by Cj the completion time and by Tj=max{Cj−dj,0} the tardiness of job j. The objective is to find a schedule which minimizes the total weighted tardiness ∑j=1nwjTj. Adopting the three-field standard notation of Graham et al. [10] we will denote this problem by 1|pjt,idleness|∑jwjTj. This problem is strongly NP-hard since it is a generalization of the single-machine total weighted tardiness problem 1∥∑jwjTj [15]. Indeed, there exists a dynamic programming algorithm with a running time for the problem 1∥∑jwjTj, but only when weights are agreeable, that is pj⩾pk⇒wj⩽wk for all jobs j and k [15]. There exists a branch and bound algorithm for the 1∥∑jwjTj problem [18], but as it is reported in [6] it cannot be used in practice on instances with more than 50 jobs. Moreover the design of approximation algorithms seems very hard, since the only known results concern only the far less general 1∥∑jTj problem with a FPTAS due to Lawler [16] in time, and slightly improved by Kovalyov [14] in time. Since the problem we consider is a broad generalization of the 1∥∑jwjTj problem, these results stress the importance of the metaheuristic approach if one wants to practically deal with instances of this problem.
Section snippets
Dynasearch
Local search algorithms, and their generalizations such as simulated annealing and tabu search (also called metaheuristics), are often used to obtain near optimal solutions for a wide range of NP-hard combinatorial optimization problems [4], [5], [19]. In these methods a neighborhood is defined, usually by giving a set of transformations that can be applied to the current solution. In the simplest local search method, at each iteration the algorithm searches the neighborhood of the current
Experimental results
There is certainly a tradeoff between the benefit of using a large neighborhood in terms of the quality of local optima and the induced time increase, relative to a small neighborhood, in order to search it. Our experiments were designed in order to determine if it was worth to spend more time exploring a larger neighborhood. To compare the performance of the standard and the dynasearch swap neighborhoods in a fair way, we have used a simple multi-start local search algorithm.
Conclusion and extensions
Our work is in the continuity of Congram et al. [6] which have introduced the dynasearch swap neighborhood for the 1∥∑jwjTj problem. By introducing the time parameter inside the dynamic programming algorithm we obtain a pseudopolynomial algorithm in time and space, whereas their algorithm needed time and space, but we enlarge considerably the class of problems which can now be treated. We need not consider problems in which the cost change between neighboring solutions depends only
References (21)
- et al.
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
(2002) - et al.
On the quality of local search for the quadratic assignment problem
Discrete Applied Mathematics
(1998) - et al.
On the classification of NP-complete problems in terms of their correlation coefficient
Discrete Applied Mathematics
(2000) - et al.
Optimization and approximation in deterministic sequencing and scheduling: A survey
Annals of Discrete Mathematics
(1979) A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness
Annals of Discrete Mathematics
(1977)A fully polynomial approximation scheme for the total tardiness problem
Operations Research Letters
(1982)- et al.
Scheduling with time dependent processing times: Review and extensions
Journal of the Operational Research Society
(1999) - et al.
Machine scheduling
- R.K. Congram, C.N. Potts, S.L. van de Velde, An iterated dynasearch algorithm for the single-machine total weighted...
- et al.
Local search heuristics for the single machine total weighted tardiness scheduling problem
INFORMS Journal on Computing
(1998)
Cited by (14)
Split-merge: Using exponential neighborhood search for scheduling a batching machine
2015, Computers and Operations ResearchCitation Excerpt :A few exponential neighborhoods for scheduling problems have been constructed in the literature before. Angel and Bampis [20] consider a time-dependent version of the well-known single-machine total weighted tardiness scheduling problem extending the work by Congram et al. [21], they develop a multi-start local search algorithm showing the superiority of dynasearch neighborhoods over traditional ones. Dynasearch, first introduced in [21], is equivalent to performing a series of ‘independent’ swap moves.
Hybrid metaheuristics in combinatorial optimization: A survey
2011, Applied Soft Computing JournalCitation Excerpt :In this paragraph, we will illustrate the principles of iterated dynasearch with respect to its application to the single-machine total weighted tardiness scheduling problem (SMTWTSP) [144]. Further contributions to this work can be found in the recent literature [145,146]. For the moment, let us simply focus on the design of a suitable neighborhood structure for a best-improvement local search.
A note on "beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time"
2011, Computers and Industrial EngineeringCitation Excerpt :From Table 3, we notice that IDS is already more efficient than MA with just 50 descents and when similar CPU time is allowed (500 descents) strongly dominates MA (overall 8218 times better and 70 worse). According to these results and other literature’s papers (Angel & Bampis, 2005; Grosso et al., 2004; Sourd, 2006), we affirm that for single machine problems where Dynasearch is relevant (without idle times, with regular objective functions, etc.), it provides a high quality benchmark when it is combined with a metaheuristic scheme. For its simplicity, IDS is an obvious choice.
Block approach-tabu search algorithm for single machine total weighted tardiness problem
2006, Computers and Industrial EngineeringApplication of time dependent scheduling algorithm in single machine task planning
2017, Agro Food Industry Hi-TechLagrangean relaxation approach to joint optimization for production planning and scheduling of synchronous assembly lines
2016, International Journal of Production Research