Sciweavers

41 search results - page 2 / 9
» A PTAS for Minimizing the Total Weighted Completion Time on ...
Sort
View
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 5 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
ESA
1999
Springer
148views Algorithms» more  ESA 1999»
13 years 10 months ago
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
Leah Epstein, Jiri Sgall
COR
2011
13 years 8 days ago
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
Sven Oliver Krumke, Alfred Taudes, Stephan Westpha...
COR
2007
106views more  COR 2007»
13 years 5 months ago
Scheduling parallel CNC machines with time/cost trade-off considerations
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
Sinan Gurel, M. Selim Akturk
COCOON
2009
Springer
13 years 3 months ago
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...
George Karakostas, Stavros G. Kolliopoulos, Jing W...