Pages that link to "Item:Q1586211"

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

Displaying 26 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)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← 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)
• Polynomial algorithms for single machine scheduling problems with financial constraints (Q1371954) (← 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)
• Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem (Q2253398) (← links)
• An exact algorithm for single-machine scheduling without machine idle time (Q2268522) (← links)
• Scheduling of tasks with effectiveness precedence constraints (Q2300636) (← links)
• Fast separation for the three-index assignment problem (Q2398106) (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
• On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
• Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
• A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861) (← links)
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem (Q2958666) (← links)
• Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690) (← links)
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
• An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems (Q5139849) (← links)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
• A time-dependent multiple criteria single-machine scheduling problem (Q5954823) (← links)
• Propagation and branching strategies for job shop scheduling minimizing the weighted energy consumption (Q6606604) (← links)