Pages that link to "Item:Q363599"
From MaRDI portal
The following pages link to Strong NP-hardness of scheduling problems with learning or aging effect (Q363599):
Displaying 6 items.
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898) (← links)
- A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times (Q1758042) (← links)
- A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times (Q1941204) (← links)
- The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard (Q2294176) (← links)
- Research on permutation flow shop scheduling problems with general position-dependent learning effects (Q2449372) (← links)
- Scheduling problem in seru production system considering DeJong's learning effect and job splitting (Q2673820) (← links)