Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time
From MaRDI portal
(Redirected from Publication:933504)
Recommendations
- Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
- Scheduling multi-operation jobs on a single machine
- Scheduling a Flexible Batching Machine
- A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
- Batch scheduling to minimize total completion time
Cites work
- A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
- Complexity of Scheduling under Precedence Constraints
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Scheduling multi-operation jobs on a single machine
- Some simplified NP-complete graph problems
- Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
Cited in
(4)- Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
- Scheduling multi-operation jobs on a single machine
- A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
- Optimal single machine scheduling of products with components and changeover cost
This page was built for publication: Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q933504)
