Pages that link to "Item:Q2378457"

The following pages link to A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows (Q2378457):

Displaying 5 items.

• Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• A solution approach to find the critical path in a time-constrained activity network (Q2270440) (← links)
• Multi-objective open shop scheduling by considering human error and preventive maintenance (Q2307240) (← links)
• A survey on scheduling problems with due windows (Q2630089) (← links)