Pages that link to "Item:Q1805453"

The following pages link to Lower bounds for the job-shop scheduling problem on multi-purpose machines (Q1805453):

Displaying 9 items.

• An effective lower bound on \(L_{\max}\) in a worker-constrained job shop (Q339585) (← links)
• 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)
• A lower bound for the job insertion problem. (Q1811122) (← links)
• Multi-machine scheduling lower bounds using decision diagrams (Q2294251) (← links)
• Scheduling unit length jobs with parallel nested machine processing set restrictions (Q2566928) (← links)
• Multiple-machine lower bounds for shop-scheduling problems (Q2884494) (← links)
• Immersed NURBS for CFD Applications (Q2948918) (← links)