Pages that link to "Item:Q1086145"

The following pages link to Openshop and flowshop scheduling to minimize sum of completion times (Q1086145):

Displaying 20 items.

• Scheduling ordered open shops (Q580167) (← links)
• Two machine openshop scheduling with machine-dependent processing times (Q678857) (← links)
• Open shop unit-time scheduling problems with symmetric objective functions (Q816431) (← links)
• Two machine flow shop scheduling problem with weighted WIP costs (Q954049) (← links)
• Flow shops with WIP and value added costs (Q969753) (← links)
• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
• Open shop scheduling with machine dependent processing times (Q1201806) (← links)
• The generalized shifting bottleneck procedure (Q1268190) (← links)
• Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems (Q1278545) (← links)
• A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
• A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876) (← links)
• Open shop scheduling with makespan and total completion time criteria (Q1818565) (← links)
• Open shop scheduling games (Q2239840) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• A cyclical search for the two machine flow shop and open shop to minimise finishing time (Q2356124) (← links)
• (Q3402497) (← links)
• Openshop scheduling under linear resources constraints (Q4381875) (← links)
• NP-hardness of compact scheduling in simplified open and flow shops. (Q5932026) (← links)