Pages that link to "Item:Q2147050"
From MaRDI portal
The following pages link to Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times (Q2147050):
Displaying 4 items.
- Scheduling with flexible resources in parallel workcenters to minimize maximum completion time (Q850309) (← links)
- Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
- Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← links)
- An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date (Q6149341) (← links)