Results 1  10
of
4,024,138
Scheduling with Rejection to Minimize the Total Weighted Completion Time ∗
"... Abstract In this paper, we address the scheduling problem with rejection in which we can choose a subset of jobs to process. Choosing not to process any job incurs a corresponding penalty. We consider the following problem for the first time: scheduling with rejection to minimize the total weighted ..."
Abstract
 Add to MetaCart
Abstract In this paper, we address the scheduling problem with rejection in which we can choose a subset of jobs to process. Choosing not to process any job incurs a corresponding penalty. We consider the following problem for the first time: scheduling with rejection to minimize the total weighted
On the Existence of Schedules that are NearOptimal for both Makespan and Total Weighted Completion Time
 OPERATIONS RESEARCH LETTERS
, 1997
"... We give a simple proof that, for any instance of a very general class of scheduling problems, there exists a schedule of makespan at most twice that of the optimal possible and of total weighted completion time at most twice that of the optimal possible. We then refine the analysis, yielding vari ..."
Abstract

Cited by 39 (3 self)
 Add to MetaCart
We give a simple proof that, for any instance of a very general class of scheduling problems, there exists a schedule of makespan at most twice that of the optimal possible and of total weighted completion time at most twice that of the optimal possible. We then refine the analysis, yielding
A Global Constraint for Total Weighted Completion Time for Cumulative Resources
, 2008
"... The criterion of total weighted completion time occurs as a subproblem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage assignment in warehouses. These applications often necessitate considering a rich set of requirements and preferences, whi ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
The criterion of total weighted completion time occurs as a subproblem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage assignment in warehouses. These applications often necessitate considering a rich set of requirements and preferences
Minimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch ∗
"... Abstract In this paper, we consider the scheduling problem of minimizing total weighted completion time on uniform machines with unbounded batch. Each of the machine Ml (l = 1,⋅⋅ ⋅,m) has a speed sl and can process up to B( ≥ n) jobs simultaneously as a batch. The processing time of a batch denoted ..."
Abstract
 Add to MetaCart
Abstract In this paper, we consider the scheduling problem of minimizing total weighted completion time on uniform machines with unbounded batch. Each of the machine Ml (l = 1,⋅⋅ ⋅,m) has a speed sl and can process up to B( ≥ n) jobs simultaneously as a batch. The processing time of a batch denoted
Dual Constrained Single Machine Sequencing to Minimize Total Weighted Completion Time
, 2005
"... We study a singlemachine sequencing problem with both release dates and deadlines to minimize the total weighted completion time. We propose a branchandbound algorithm for this problem. The algorithm exploits an effective lower bound and a dynamic programming dominance technique. As a byproduct o ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We study a singlemachine sequencing problem with both release dates and deadlines to minimize the total weighted completion time. We propose a branchandbound algorithm for this problem. The algorithm exploits an effective lower bound and a dynamic programming dominance technique. As a byproduct
Minimizing Total Weighted Completion Time in a Proportionate Flow Shop
, 1996
"... We study the special case of the m machine flow shop problem in which the processing time of each operation of job j is equal to p j ; this variant of the flow shop problem is known as the proportionate flow shop problem. We show that for any number of machines and for any regular performance criter ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that the problem of minimizing total weighted completion time is solvable in O(n 2 ) time. 1980 Mathematics Subject Classification (1991): 90B35. Key Words and Phrases: flow shop scheduling, weighted
Customer order scheduling to minimize total weighted completion time
 Copyright ⓒ 2014 SERSC 325 Journal of Multimedia and Ubiquitous Engineering Vol.9, No.4
, 2014
"... Abstract In this paper we study the scheduling problem in which each customer order consists of several jobs of different types, which are to be processed on m facilities. Each facility is dedicated to the processing of only one type of jobs. All jobs of an order have to be delivered to the custome ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
to the customer at the same time. The objective is to schedule all the orders to minimize the total weighted order completion time. While the problem has been shown to be unary NPhard, we develop a heuristics to tackle the problem and analyze its worstcase performance.
A PTAS For Minimizing The Total Weighted Completion Time On Identical Parallel Machines
 MATHEMATICS OF OPERATIONS RESEARCH
, 1999
"... We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NPhard in the strong sense. The best approximation result known so far was a 1 2 (1 + p 2)approximation algorithm that has been der ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NPhard in the strong sense. The best approximation result known so far was a 1 2 (1 + p 2)approximation algorithm that has been
MINIMIZING THE TOTAL WEIGHTED COMPLETION TIME ON UNRELATED PARALLEL MACHINES WITH STOCHASTIC TIMES
"... This paper addresses the problem of batch scheduling in an unrelated parallel machine environment with sequence dependent setup times and an objective of minimizing the weighted mean completion time. Identical jobs are batched together and are available at time zero. Processing time of each job of a ..."
Abstract
 Add to MetaCart
This paper addresses the problem of batch scheduling in an unrelated parallel machine environment with sequence dependent setup times and an objective of minimizing the weighted mean completion time. Identical jobs are batched together and are available at time zero. Processing time of each job
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LPBased Heuristics and Lower Bounds
"... There has been recent success in using polyhedral formulations of scheduling problems not only to obtain good lower bounds in practice but also to develop provably good approximation algorithms. Most of these formulations rely on binary decision variables that are a kind of assignment variables. We ..."
Abstract

Cited by 54 (9 self)
 Add to MetaCart
. We present quite simple polynomialtime approximation algorithms that are based on linear programming formulations with completion time variables and give the best known performance guarantees for minimizing the total weighted completion time in several scheduling environments. This amplifies
Results 1  10
of
4,024,138