Pages that link to "Item:Q2366077"

The following pages link to A new lower bound for the job-shop scheduling problem (Q2366077):

Displaying 12 items.

• An effective lower bound on \(L_{\max}\) in a worker-constrained job shop (Q339585) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
• The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331) (← links)
• Lower bounds for the job-shop scheduling problem on multi-purpose machines (Q1805453) (← links)
• Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
• A lower bound for the job insertion problem. (Q1811122) (← links)
• Lagrangian bounds for just-in-time job-shop scheduling (Q2456651) (← links)
• Modelling and heuristics of FMS scheduling with multiple objectives (Q2566932) (← links)
• A new approach to computing optimal schedules for the job-shop scheduling problem (Q4645937) (← links)
• Minimizing <i>L</i> _max for large-scale, job-shop scheduling problems (Q4671351) (← links)
• Application of quantum approximate optimization algorithm to job shop scheduling problem (Q6113354) (← links)