Pages that link to "Item:Q4427325"

The following pages link to Time-Indexed Formulations for Machine Scheduling Problems: Column Generation (Q4427325):

Displaying 50 items.

• Dynamic resource allocation: a flexible and tractable modeling framework (Q299823) (← links)
• Scheduling evacuation operations (Q309072) (← links)
• Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations (Q322692) (← links)
• Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals (Q322736) (← links)
• A branch and price solution approach for order acceptance and capacity planning in make-to-order operations (Q418059) (← links)
• Column generation for extended formulations (Q458128) (← links)
• Branch-and-price approach for the multi-skill project scheduling problem (Q479223) (← 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)
• A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
• Shipment planning at oil refineries using column generation and valid inequalities (Q706854) (← links)
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
• A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
• Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← links)
• On a fix-and-relax framework for a class of project scheduling problems (Q817205) (← links)
• A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
• Column generation heuristics for multiple machine, multiple orders per job scheduling problems (Q940892) (← links)
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
• Non-binary quantified CSP: Algorithms and modelling (Q1037645) (← 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)
• The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
• A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
• Integrated production and delivery scheduling for multi-factory supply chain with stage-dependent inventory holding cost (Q1699357) (← links)
• Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty (Q1713736) (← links)
• A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports (Q1751727) (← links)
• Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514) (← links)
• Earliness-tardiness scheduling with setup considerations (Q1777159) (← links)
• Valid inequalities for a time-indexed formulation (Q1785357) (← links)
• Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
• Two alternative models for farm management: Discrete versus continuous time horizon (Q1869414) (← links)
• Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers (Q2077972) (← links)
• An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• An exact algorithm for single-machine scheduling without machine idle time (Q2268522) (← links)
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties (Q2285347) (← links)
• The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
• A global constraint for total weighted completion time for unary resources (Q2430362) (← links)
• A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
• A 0-1 integer linear programming approach to schedule outages of nuclear power plants (Q2434323) (← links)
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
• Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)