Pages that link to "Item:Q2450667"
From MaRDI portal
The following pages link to Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (Q2450667):
Displayed 5 items.
- Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem (Q282252) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Scheduling with time-dependent discrepancy times (Q1702735) (← links)
- Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution (Q1754012) (← links)
- Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry (Q5257894) (← links)