Theoretical and practical issues in single-machine scheduling with two job release and delivery times
From MaRDI portal
Publication:2066683
DOI10.1007/s10951-021-00708-4zbMath1480.90142OpenAlexW3200427486MaRDI QIDQ2066683
Alejandro Reynoso, Nodari Vakhania
Publication date: 14 January 2022
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-021-00708-4
single-machine schedulingtime complexityrelease timedelivery timepolynomial and pseudo-polynomial time algorithmsSUBSET SUM
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Minimization of the maximal lateness for a single machine
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
- Single-machine scheduling with release times and tails
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times
- Theoretical expectation versus practical performance of Jackson's heuristic
- Fast solution of single-machine scheduling problem with embedded jobs
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A better algorithm for sequencing with release and delivery times on identical machines
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem
This page was built for publication: Theoretical and practical issues in single-machine scheduling with two job release and delivery times
