Pages that link to "Item:Q968014"

The following pages link to An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014):

Displaying 2 items.

• 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)