Amanote Research

Amanote Research

    RegisterSign In

How Unsplittable-Flow-Covering Helps Scheduling With Job-Dependent Cost Functions

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-43948-7_52
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2014

Authors
Wiebke HöhnJulián MestreAndreas Wiese
Publisher

Springer Berlin Heidelberg


Related search

Single Machine Scheduling With a Generalized Job-Dependent Cumulative Effect

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2016English

Submodular Unsplittable Flow on Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Submodular Unsplittable Flow on Trees

Mathematical Programming, Series B
MathematicsSoftware
2018English

Flow Shop Scheduling Problem With Four Machines N-Job for Minimizing Makespan

International Journal of Engineering Research and
2017English

Combining Metaheuristics for the Job Shop Scheduling Problem With Sequence Dependent Setup Times

Communications in Computer and Information Science
MathematicsComputer Science
English

How Hercules Helps...

Chemical and Engineering News
Chemical Engineering
1954English

How Hercules Helps...

Chemical and Engineering News
Chemical Engineering
1955English

How Hercules Helps...

Chemical and Engineering News
Chemical Engineering
1956English

How Hercules Helps...

Chemical and Engineering News
Chemical Engineering
1966English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy