Results 1  10
of
14,098
Algorithms for Special Single Machine Total Tardiness Problems
, 2008
"... The scheduling problem of minimizing total tardiness on a single machine is known to be NPhard in the ordinary sense. In this paper, we consider the special case of the problem when the processing times pj and the due dates dj of the jobs j, j ∈ N = {1, 2,..., n}, are oppositely ordered: p1 ≥ p2 ≥ ..."
Abstract
 Add to MetaCart
The scheduling problem of minimizing total tardiness on a single machine is known to be NPhard in the ordinary sense. In this paper, we consider the special case of the problem when the processing times pj and the due dates dj of the jobs j, j ∈ N = {1, 2,..., n}, are oppositely ordered: p1 ≥ p2
Designing Dispatching Rules to Minimize Total Tardiness
"... Summary. We approximate optimal solutions to the Flexible JobShop Problem by using dispatching rules discovered through Genetic Programming. While Simple Priority Rules have been widely applied in practice, their efficacy remains poor due to lack of a global view. Composite Dispatching Rules have b ..."
Abstract
 Add to MetaCart
that Composite Dispatching Rules generated by our Genetic Programming framework outperforms the Single and Composite Dispatching Rules selected from literature over large validation sets with respect to total tardiness. Further results on sensitivity to changes (in coefficient values and terminals) among
On Minimizing Total Tardiness In A Serial Batching Problem
, 1999
"... . We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. Thi ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
. We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs
A BOUND FOR THE TOTAL TARDINESS PROBLEM ON A SINGLE MACHINE
"... We present a simple result in singlemachine scheduling theory. Namely, the number of tardy jobs in a sequence which is optimal with respect to total tardiness is no greater than the number of tardy jobs in the earliest due date sequence. This provides a bound for solutions to the total tardiness pr ..."
Abstract
 Add to MetaCart
We present a simple result in singlemachine scheduling theory. Namely, the number of tardy jobs in a sequence which is optimal with respect to total tardiness is no greater than the number of tardy jobs in the earliest due date sequence. This provides a bound for solutions to the total tardiness
An Ant Algorithm with a new Pheromone Evaluation Rule for Total Tardiness Problems
 Proceedings of EvoWorkshops 2000, volume 1803 of LNCS
, 2000
"... Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness Problem. Compared to an existing ACO algorithm for the unweighted Total Tardiness Problem our algorithm has several imp ..."
Abstract

Cited by 34 (8 self)
 Add to MetaCart
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness Problem. Compared to an existing ACO algorithm for the unweighted Total Tardiness Problem our algorithm has several
MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING
, 1994
"... Abstract We consider the single machine sequencing problem in which each job has a processing time and a due date. The objective is to find a sequence of n jobs which minimizes the sum of the tardiness of each job. We present an O ( n log n) MDD (Modified Due Date) rule which satisfies local optimal ..."
Abstract
 Add to MetaCart
Abstract We consider the single machine sequencing problem in which each job has a processing time and a due date. The objective is to find a sequence of n jobs which minimizes the sum of the tardiness of each job. We present an O ( n log n) MDD (Modified Due Date) rule which satisfies local
An Ant Colony Optimization Approach for the Single Machine Total Tardiness Problem
 In CEC99: Proceedings of the Congress on Evolutionary Computation
, 1999
"... Machine scheduling is a central task in production planning. In general it means the problem of scheduling job operations on a given number of available machines. In this paper we consider a machine scheduling problem with one machine, the Single Machine Total Tardiness Problem. To solve this NPhar ..."
Abstract

Cited by 39 (0 self)
 Add to MetaCart
Machine scheduling is a central task in production planning. In general it means the problem of scheduling job operations on a given number of available machines. In this paper we consider a machine scheduling problem with one machine, the Single Machine Total Tardiness Problem. To solve this NP
Solution algorithms for the total tardiness scheduling problem on a single machine
 Workshop Proceedings of the ENC’04 International Conference 2004
"... Abstract. We study the classical NPhard in the ordinary sense singlemachine total tardiness scheduling problem 1   ∑Tj. New polynomial and pseudopolynomial solvable cases of the problem are presented and respective algorithms are proposed with no more than O(n2 pj) time. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We study the classical NPhard in the ordinary sense singlemachine total tardiness scheduling problem 1   ∑Tj. New polynomial and pseudopolynomial solvable cases of the problem are presented and respective algorithms are proposed with no more than O(n2 pj) time.
Minimizing the total tardiness in a flexible jobshop 1 Problem formulation
"... The flexible jobshop is an extension of the classical jobshop. In such a configuration, the machines are capable to execute a subset of operations. To each operation, we can associate a non empty set of machines that can execute this operation. In this article, we consider the minimization of the ..."
Abstract
 Add to MetaCart
of the total tardiness in a flexible jobshop. In our knowledge, this criterion is not previously studied for this type of shop configuration. The total tardiness criterion was mainly considered in the single machine problem (Chu [Chu92] and Souissi et al. [SKC04]). Few references studied this criterion in a
Stochastic Local Search for Multiprocessor Scheduling for Minimum Total Tardiness
 Proceedings of the Canadian Conference on Artificial Intelligence, Lecture Notes in Computer Science
, 2003
"... The multiprocessor total tardiness problem (MPTTP) is an NPhard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a number of processors. Exact algorithms like branch and bound have proven to be impractical for the MPTTP, leaving stochastic l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The multiprocessor total tardiness problem (MPTTP) is an NPhard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a number of processors. Exact algorithms like branch and bound have proven to be impractical for the MPTTP, leaving stochastic
Results 1  10
of
14,098