Pages that link to "Item:Q4656745"

The following pages link to A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint (Q4656745):

Displaying 7 items.

• Mathematical model for cyclic scheduling with work-in-process minimization (Q656064) (← links)
• Non-preemptive two-machine open shop scheduling with non-availability constraints (Q1395372) (← links)
• A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs (Q2449360) (← links)
• Optimising lot sizing and order scheduling with non-linear production rates (Q3163341) (← links)