Pages that link to "Item:Q985311"

The following pages link to On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311):

Displaying 16 items.

• Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity (Q339549) (← links)
• A space-indexed formulation of packing boxes into a larger box (Q433833) (← links)
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
• A new model for the preemptive earliness-tardiness scheduling problem (Q1013402) (← links)
• Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars (Q1046123) (← links)
• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem (Q1762096) (← links)
• Scheduling lower bounds via AND subset sum (Q2121467) (← links)
• An exact algorithm for single-machine scheduling without machine idle time (Q2268522) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
• A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861) (← links)
• Exploiting Packing Components in General-Purpose Integer Programming Solvers (Q4634979) (← links)
• An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems (Q5139849) (← links)