Pages that link to "Item:Q335350"

The following pages link to The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350):

Displaying 4 items.

• Open shop scheduling with synchronization (Q1702656) (← links)
• Allocation under a general substitution structure (Q1737487) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Scheduling a proportionate flow shop of batching machines (Q5919041) (← links)