Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
From MaRDI portal
Recommendations
- Solving Parallel Machine Scheduling Problems by Column Generation
- Time-indexed formulations and the total weighted tardiness problem
- A time indexed formulation of non-preemptive single machine scheduling problems
- Column generation for solving parallel machine scheduling problem
- Parallel machine scheduling by column generation
Cited in
(85)- A 0-1 integer linear programming approach to schedule outages of nuclear power plants
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- Scheduling evacuation operations
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Computation of approximate -points for large scale single machine scheduling problem
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- An efficient solution methodology for the airport slot allocation problem with preprocessing and column-and-row generation
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
- Layered graph approaches for combinatorial optimization problems
- Models and algorithms for configuring and testing prototype cars
- Formulations and heuristic for the long-term preventive maintenance order scheduling problem
- Time-indexed formulations and the total weighted tardiness problem
- Column generation heuristics for multiple machine, multiple orders per job scheduling problems
- An improved decision support model for scheduling production in an engineer-to-order manufacturer
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Resource-constrained scheduling with non-constant capacity and non-regular activities
- Unrelated parallel machine scheduling with new criteria: complexity and models
- On the exact solution of a large class of parallel machine scheduling problems
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
- Consistency cuts for Dantzig-Wolfe reformulations
- Scheduling in manufacturing with transportation: classification and solution techniques
- Mathematical models and an effective exact algorithm for unrelated parallel machine scheduling with family setup times and machine cost
- Scheduling projects with labor constraints
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Dynamic resource allocation: a flexible and tractable modeling framework
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
- Changeover formulations for discrete-time mixed-integer programming scheduling models
- Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes
- Multi-Product Inventory Logistics Modeling in the Process Industries
- The single-processor scheduling problem with time restrictions: complexity and related problems
- Exact approaches for single machine total weighted tardiness batch scheduling
- On a fix-and-relax framework for a class of project scheduling problems
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
- A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
- A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints
- Optimal solutions for a dock assignment problem with trailer transportation
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Column generation for extended formulations
- Integrated charge batching and casting width selection at Baosteel
- Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
- Integrated production and delivery scheduling for multi-factory supply chain with stage-dependent inventory holding cost
- Valid inequalities for a time-indexed formulation
- A global constraint for total weighted completion time for unary resources
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- Branch-and-price approach for the multi-skill project scheduling problem
- A bucket indexed formulation for nonpreemptive single machine scheduling problems
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A time-indexed LP-based approach for min-sum job-shop problems
- A stabilized column generation scheme for the traveling salesman subtour problem
- Shipment planning at oil refineries using column generation and valid inequalities
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
- Dantzig-Wolfe Decomposition for Job Shop Scheduling
- Exact algorithms for energy-constrained scheduling on identical parallel machines
- An exact algorithm for single-machine scheduling without machine idle time
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
- A Lagrangian heuristic for satellite range scheduling with resource constraints
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Simultaneous scheduling of replacement and repair of common components in operating systems. A multi-objective mathematical optimization model
- The asymmetric traveling salesman problem with replenishment arcs
- A time-indexed generalized vehicle routing model for military aircraft mission planning
- A time-indexed generalized vehicle routing model and stabilized column generation for military aircraft mission planning
- Non-binary quantified CSP: Algorithms and modelling
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Two alternative models for farm management: Discrete versus continuous time horizon
- The vehicle routing problem with time windows and temporal dependencies
- Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- Earliness-tardiness scheduling with setup considerations
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- Decomposition and dynamic cut generation in integer linear programming
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty
This page was built for publication: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427325)