An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
From MaRDI portal
Publication:2128769
Recommendations
- Relocation scheduling subject to fixed processing sequences
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Minimizing the total weighted completion time in the relocation problem
- Some results of the relocation problems with processing times and deadlines
Cites work
- A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand
- Fully polynomial time approximation schemes for stochastic dynamic programs
- Minimizing the total weighted completion time in the relocation problem
- On relocation problems with multiple identical working crews
- Relocation problems are hard
- Relocation scheduling subject to fixed processing sequences
Cited in
(6)- Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities
- Generating the best \(K\) sequences in relocation problems
- Relocation scheduling subject to fixed processing sequences
- On the relocation problem with a second working crew for resource recycling
- An FPTAS for scheduling with resource constraints
- On relocation problems with multiple identical working crews
This page was built for publication: An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128769)
