scientific article; zbMATH DE number 2089208
From MaRDI portal
Publication:3046477
Recommendations
- A linear time approximation scheme for the single machine scheduling problem with controllable processing times
- scientific article; zbMATH DE number 1870508
- An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Approximation schemes for job shop scheduling problems with controllable processing times
Cited in
(10)- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
- Positive half-products and scheduling with controllable processing times
- Semi-definite relaxation algorithm for single machine scheduling with controllable processing times
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Approximation schemes for job shop scheduling problems with controllable processing times
- Two FPTAS algorithms of problem \(1|r_j\), dm\(|C_{\max}+TPC\)
- scientific article; zbMATH DE number 1870508 (Why is no real title available?)
- A linear time approximation scheme for the single machine scheduling problem with controllable processing times
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046477)
