Pages that link to "Item:Q2294176"

The following pages link to The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard (Q2294176):

Displaying 9 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)
• NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time (Q859949) (← links)
• Single-machine scheduling problems with the general sum-of-processing-time and position-dependent effect function (Q2046982) (← links)
• Queuing search algorithm: a novel metaheuristic algorithm for solving engineering optimization problems (Q2306943) (← links)
• A note on resource allocation scheduling with position-dependent workloads (Q5058801) (← links)
• Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect (Q6081596) (← links)
• Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach (Q6106764) (← links)