Pages that link to "Item:Q2467449"
From MaRDI portal
The following pages link to Complexity of the job insertion problem in multi-stage scheduling (Q2467449):
Displaying 4 items.
- Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
- A lower bound for the job insertion problem. (Q1811122) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Feasible job insertions in the multi-processor-task job shop (Q2464217) (← links)
