Scheduling Partially Ordered Jobs Faster Than 2 n

DOI10.1007/978-3-642-23719-5_26zbMath1346.90336arXiv1108.0810OpenAlexW2170882388MaRDI QIDQ3092238

Jakub Onufry Wojtaszczyk, Marcin Pilipczuk, Michał Pilipczuk, Marek Cygan

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.0810

zbMATH Keywords

job schedulingmoderately exponential algorithmsjobs with precedences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

On an extension of the Sort \& Search method with application to scheduling theory ⋮ On exact algorithms for the permutation CSP ⋮ Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) ⋮ Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms ⋮ Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights ⋮ Moderate exponential-time algorithms for scheduling problems

This page was built for publication: Scheduling Partially Ordered Jobs Faster Than 2 n