Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Scheduling meets \(n\)-fold integer programming - MaRDI portal

Scheduling meets \(n\)-fold integer programming (Q2317129)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Scheduling meets \(n\)-fold integer programming	scientific article

Statements

scholarly article

0 references

Scheduling meets \(n\)-fold integer programming (English)

0 references

0 references

Martin Koutecký

0 references

Journal of Scheduling

0 references

publication date

8 August 2019

0 references

full work available at URL

https://arxiv.org/abs/1603.02611

0 references

zbMATH Keywords

fixed parameterized tractability

0 references

scheduling on parallel machines

0 references

MaRDI profile type

MaRDI publication profile

0 references

The third comprehensive survey on scheduling problems with setup times/costs

0 references

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

0 references

Semidefinite Optimization and Convex Algebraic Geometry

0 references

\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling

0 references

Scheduling independent tasks to reduce mean finishing time

0 references

0 references

Fundamentals of parameterized complexity

0 references

On the parametric complexity of schedules to minimize tardy tasks.

0 references

0 references

Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler

0 references

Strip Graphs: Recognition and Scheduling

0 references

Graver basis and proximity techniques for block-structured separable convex integer minimization problems

0 references

\(n\)-fold integer programming in cubic time

0 references

Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs

0 references

A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)

0 references

Convex separable optimization is not much harder than linear optimization

0 references

Technical Note—Minimizing Average Flow Time with Parallel Machines

0 references

Bin packing with fixed number of bins revisited

0 references

Integer optimization on convex semialgebraic sets

0 references

0 references

A complete 4-parametric complexity classification of short shop scheduling problems

0 references

Integer Programming with a Fixed Number of Variables

0 references

0 references

Scheduling and fixed-parameter tractability

0 references

Nonlinear discrete optimization. An algorithmic theory

0 references

Huge Unimodular $n$-Fold Programs

0 references

Fifty years of scheduling: a survey of milestones

0 references

Complexity of preemptive minsum scheduling on unrelated parallel machines

0 references

Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width

0 references

Interval scheduling and colorful independent sets

0 references

A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack

0 references

Completing Partial Schedules for Open Shop with Unit Processing Times and Routing

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10951-017-0550-0

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

DBLP publication ID

journals/scheduling/KnopK18

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2317129

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2317129&oldid=37892284"