Solving Parallel Machine Scheduling Problems by Column Generation
From MaRDI portal
Recommendations
- Parallel machine scheduling by column generation
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- Column generation for solving parallel machine scheduling problem
- A column generation for a parallel machine scheduling with sequence-dependent setup times
- Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions
Cited in
(82)- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones
- Hierarchical production planning and scheduling in a multi-product, batch process environment
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm
- Spatial scheduling and workforce assignment problem in block assembly shop of shipbuilding
- Parallel machine scheduling by column generation
- An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
- Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
- Parallel branch-and-price algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
- Revisiting the development trajectory of parallel machine scheduling
- Parallel machine scheduling with a common due window
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
- An improved decision support model for scheduling production in an engineer-to-order manufacturer
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
- On the exact solution of a large class of parallel machine scheduling problems
- Column generation for solving parallel machine scheduling problem
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- Heuristics for online scheduling on identical parallel machines with two GoS levels
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- Minimizing the weighted number of tardy jobs on parallel processors
- A branch and price algorithm for single-machine completion time variance
- Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria
- A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
- Optimal scheduling on unrelated parallel machines with combinatorial auction
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Solving the selective multi-category parallel-servicing problem
- An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems
- Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation
- Lexicographic column generation with a tree search pricing algorithm
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Integrated charge batching and casting width selection at Baosteel
- Reducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insights
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Decomposition methods for the parallel machine scheduling problem with setups
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- The fixed-charge shortest-path problem
- A branch and price algorithm for the pharmacy duty scheduling problem
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Applying Column Generation to Machine Scheduling
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- Group-scheduling problems in electronics manufacturing
- Optimal and heuristic solution methods for a multiprocessor machine scheduling problem
- Parallel machine scheduling with precedence constraints and setup times
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity
- A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production
- A branch-and-price algorithm for energy aware task scheduling of constellations of nanosatellites
- Dantzig-Wolfe Decomposition for Job Shop Scheduling
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- Matching based very large-scale neighborhoods for parallel machine scheduling
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- Truck scheduling in cross-docking terminals with fixed outbound departures
- On compact formulations for integer programs solved by column generation
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- A column generation for a parallel machine scheduling with sequence-dependent setup times
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- A competitive online algorithm for minimizing total weighted completion time on uniform machines
- Scheduling with divisible jobs and subcontracting option
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates
- Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
This page was built for publication: Solving Parallel Machine Scheduling Problems by Column Generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427365)
