Pages that link to "Item:Q3502134"

The following pages link to Tight bounds for the identical parallel machine‐scheduling problem: Part II (Q3502134):

Displaying 7 items.

• Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
• A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
• Heuristics and exact methods for number partitioning (Q1038378) (← links)
• Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154) (← links)
• A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
• A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations (Q5416762) (← links)
• Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods (Q6090983) (← links)