Pages that link to "Item:Q336999"
From MaRDI portal
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 4 items.
- Scheduling with job-splitting considering learning and the vital-few law (Q1652529) (← 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)