Pages that link to "Item:Q1381777"

The following pages link to Optimal makespan scheduling with given bounds of processing times (Q1381777):

Displaying 16 items.

• Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133) (← links)
• Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
• Group shops scheduling with makespan criterion subject to random release dates and processing times (Q733535) (← links)
• Optimality region for job permutation in single-machine scheduling with uncertain processing times (Q827990) (← links)
• Stability polyhedra of optimal permutation of jobs servicing (Q893928) (← links)
• Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917) (← links)
• Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time (Q980257) (← links)
• Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness (Q1715728) (← links)
• Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
• Mean flow time minimization with given bounds of processing times (Q1887954) (← links)
• Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times (Q2244222) (← links)
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
• Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← links)
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
• Uncertainty measure for the Bellman-Johnson problem with interval processing times (Q2452733) (← links)