Pages that link to "Item:Q1586211"

The following pages link to A polyhedral approach to single-machine scheduling problems. (Q1586211):

Displaying 9 items.

• A branch and price solution approach for order acceptance and capacity planning in make-to-order operations (Q418059) (← links)
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
• Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
• Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars (Q1046123) (← links)
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514) (← links)
• Valid inequalities for a time-indexed formulation (Q1785357) (← links)