Scheduling with release dates on a single machine to minimize total weighted completion time
Discrete Applied Mathematics
New bounds for the identical parallel processor weighted flow time problem
Management Science
Scheduling identical parallel machines to minimize total weighted completion time
CO89 Selected papers of the conference on Combinatorial Optimization
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Scheduling equal-length jobs on identical parallel machines
Discrete Applied Mathematics
Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
Scheduling Jobs that Arrive Over Time (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Solving Parallel Machine Scheduling Problems by Column Generation
INFORMS Journal on Computing
A new dynamic programming algorithm for the parallel machines total weighted completion time problem
Operations Research Letters
A Global Constraint for Total Weighted Completion Time
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Computers and Operations Research
| Hi-index | 0.01 |
In this paper, we consider an identical parallel machine scheduling problem with release dates. The objective is to minimize the total weighted completion time. This problem is known to be strongly NP-hard. We propose some dominance properties and two lower bounds. We also present an efficient heuristic. A branch-and-bound algorithm, in which the heuristic, the lower bounds and the dominance properties are incorporated, is proposed and tested on a large set of randomly generated instances.