On the relocation problem with a second working crew for resource recycling
From MaRDI portal
Publication:5426652
Recommendations
- Resource-constrained flowshop scheduling with separate resource recycling operations
- On relocation problems with multiple identical working crews
- Some results of the relocation problems with processing times and deadlines
- An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
- Relocation scheduling subject to fixed processing sequences
Cites work
- A fast feasibility test for relocation problems
- Generating the best \(K\) sequences in relocation problems
- Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Polynomial algorithms for single machine scheduling problems with financial constraints
- Relocation problems are hard
- Relocation problems of maximizing new capacities under a common due date
- Scheduling subject to resource constraints: Classification and complexity
- Some results of the relocation problems with processing times and deadlines
Cited in
(4)
This page was built for publication: On the relocation problem with a second working crew for resource recycling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426652)