A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
From MaRDI portal
Publication:2464405
Recommendations
- Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
- Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time
- Scheduling multi-operation jobs on a single machine
- A note on the complexity of family scheduling to minimize the number of late jobs
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Cited in
(9)- Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
- Scheduling multi-operation jobs on a single machine
- A survey of scheduling problems with setup times or costs
- Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
- scientific article; zbMATH DE number 1462526 (Why is no real title available?)
- Sorting common operations to minimize the number of tardy jobs
- A note on the complexity of family scheduling to minimize the number of late jobs
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time
This page was built for publication: A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464405)
