Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

47

IJCSS
2002

104views more IJCSS 2002»

Complexity results on open shop scheduling to minimize total cost of operations

15 years 2 months ago

Complexity results on open shop scheduling to minimize total cost of operations

Download www.eti.pg.gda.pl

Krzysztof Giaro, Marek Kubale, Konrad Piwakowski

Real-time Traffic

IJCSS 2002 |

claim paper

Related Content

» Nonapproximability Results for Scheduling Problems with Minsum Criteria

» A global constraint for total weighted completion time for unary resources

» Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm

» Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

» ThermalAware Task Scheduling to Minimize Energy Usage of Blade Server Based Datacenters

» A Global Constraint for Total Weighted Completion Time

» Complexity Results for Collective Communications on Heterogeneous Platforms

» Considering manufacturing cost and scheduling performance on a CNC turning machine

» Scheduling parallel CNC machines with timecost tradeoff considerations

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2002
Where	IJCSS
Authors	Krzysztof Giaro, Marek Kubale, Konrad Piwakowski

Comments (0)