Pages that link to "Item:Q336999"

The following pages link to Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models (Q336999):

Displaying 7 items.

• The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model (Q712692) (← links)
• Scheduling with job-splitting considering learning and the vital-few law (Q1652529) (← links)
• Parallel machine scheduling with general sum of processing time based models (Q1675579) (← links)
• Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects (Q1751144) (← links)
• Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
• The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard (Q2294176) (← links)
• Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines (Q2883611) (← links)