Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
From MaRDI portal
Publication:2307497
DOI10.1007/s10878-019-00512-zzbMath1442.90085OpenAlexW2995446686WikidataQ115604008 ScholiaQ115604008MaRDI QIDQ2307497
Lei Shang, Vincent T'kindt, Frederico Della Croce
Publication date: 24 March 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00512-z
Related Items (3)
Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs ⋮ Equitable scheduling on a single machine ⋮ Moderate exponential-time algorithms for scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Solving the job-shop scheduling problem optimally by dynamic programming
- On an extension of the Sort \& Search method with application to scheduling theory
- Exact exponential algorithms.
- Exact exponential algorithms for 3-machine flowshop scheduling problems
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Scheduling Partially Ordered Jobs Faster Than 2 n
- A Dynamic Programming Approach to Sequencing Problems
- Minimizing the average deviation of job completion times about a common due date
- On the Assignment of Optimal Due Dates
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Computing Partitions with Applications to the Knapsack Problem
- Parameterized and Exact Computation
- Bounding the Running Time of Algorithms for Scheduling and Packing Problems
This page was built for publication: Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
