Pages that link to "Item:Q1805453"
From MaRDI portal
The following pages link to Lower bounds for the job-shop scheduling problem on multi-purpose machines (Q1805453):
Displayed 5 items.
- The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331) (← links)
- Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
- A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times (Q1643055) (← links)
- Scheduling unit length jobs with parallel nested machine processing set restrictions (Q2566928) (← links)
- Immersed NURBS for CFD Applications (Q2948918) (← links)