An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times
From MaRDI portal
Publication:6090764
Recommendations
- Scheduling Algorithms for Single Machine Problem with Release and Delivery Times
- An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
- Preemptive scheduling with release dates, delivery times and sequence independent setup times
- An improved approximation algorithm for single machine scheduling with job delivery
- Single machine scheduling with release dates and job delivery to minimize the makespan
Cites work
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- A block approach for single-machine scheduling with release dates and due dates
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- The one-machine sequencing problem
This page was built for publication: An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090764)