Pages that link to "Item:Q853028"

The following pages link to A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028):

Displaying 18 items.

• The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
• No-wait flexible flow shop scheduling with due windows (Q1665716) (← links)
• A branch-and-price algorithm for the aperiodic multi-period service scheduling problem (Q1694820) (← links)
• Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
• An exact branch-and-price algorithm for scheduling rescue units during disaster response (Q1991141) (← links)
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
• An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
• Timed route approaches for large multi-product multi-step capacitated production planning problems (Q2116870) (← links)
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines (Q2297569) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• The one-dimensional cutting stock problem with sequence-dependent cut losses (Q2803252) (← links)
• A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates (Q3102810) (← links)
• A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)
• Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times (Q6070133) (← links)