Scheduling Partially Ordered Jobs Faster Than 2 N

Algorithmica - United States
doi 10.1007/s00453-012-9694-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Solving Multicut Faster Than 2 N

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Scheduling Jobs With Stochastically Ordered Processing Times on Parallel Machines to Minimize Expected Flowtime

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
1986English

Technology Industries Helped Post-Great Recession Jobs Grow Faster in Northern Than in Southern California

Monthly Labor Review
ManagementOrganizational BehaviorHuman Resource ManagementStrategyInnovationManagement of Technology
2014English

Special Case Algorithm for N-Jobs M-Machines Flow Shop Scheduling Problems

Applied and Computational Mathematics
2017English

Partially Ordered Topological Spaces

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1954English

Faster Than a Speeding CD?

Against the Grain
2013English

$\Aleph \Sb{0}$-Categoricity of Partially Ordered Sets of Width $2.$

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1977English

Messages Diffuse Faster Than Messengers

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2006English

Scheduling Jobs That Arrive Over Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy