Pages that link to "Item:Q422898"
From MaRDI portal
The following pages link to The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898):
Displaying 11 items.
- Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models (Q336999) (← links)
- Strong NP-hardness of scheduling problems with learning or aging effect (Q363599) (← links)
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898) (← links)
- A single-machine bi-criterion scheduling problem with two agents (Q482429) (← links)
- Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time (Q727300) (← links)
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364) (← links)
- Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness (Q1666458) (← links)
- Task scheduling in distributed real-time systems (Q1745808) (← links)
- Single-machine scheduling with upper bounded maintenance time under the deteriorating effect (Q1956114) (← links)
- Two-agent single-machine scheduling with cumulative deterioration (Q2001202) (← links)
- Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
