On an extension of the Sort \& Search method with application to scheduling theory
From MaRDI portal
Publication:392015
DOI10.1016/j.tcs.2013.05.023zbMath1358.68084OpenAlexW2010662359MaRDI QIDQ392015
Mathieu Liedloff, Vincent T'kindt, Christophe Lenté, Ameur Soukhal
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.023
Analysis of algorithms (68W40) Searching and sorting (68P10) Deterministic scheduling theory in operations research (90B35)
Related Items (11)
New algorithms for minimizing the weighted number of tardy jobs on a single machine ⋮ A characterization of optimal multiprocessor schedules and new dominance rules ⋮ On the optimality of exact and approximation algorithms for scheduling problems ⋮ Minimizing the number of tardy jobs in two-machine settings with common due date ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics ⋮ Exact exponential algorithms for 3-machine flowshop scheduling problems ⋮ Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms ⋮ An exact exponential branch-and-merge algorithm for the single machine total tardiness problem ⋮ Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights ⋮ Moderate exponential-time algorithms for scheduling problems
Cites Work
- Exact exponential algorithms.
- Scheduling Partially Ordered Jobs Faster Than 2 n
- Computing Partitions with Applications to the Knapsack Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Scheduling
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On an extension of the Sort \& Search method with application to scheduling theory
