Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
From MaRDI portal
Publication:621754
DOI10.1007/s12532-010-0019-zzbMath1208.90119OpenAlexW2122268482MaRDI QIDQ621754
Rosiane Rodrigues, Eduardo Uchoa, Marcus Poggi de Aragão, Artur Alves Pessoa
Publication date: 28 January 2011
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-010-0019-z
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (50)
Layered graph approaches for combinatorial optimization problems ⋮ A column-generation-based algorithm for a resource-constrained project scheduling problem with a fractional shared resource ⋮ Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times ⋮ A column generation approach for locating roadside clinics in Africa based on effectiveness and equity ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Improved branch-cut-and-price for capacitated vehicle routing ⋮ Stabilizing branch‐and‐price for constrained tree problems ⋮ Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time ⋮ A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production ⋮ The vehicle routing problem with service level constraints ⋮ An exact algorithm for the service network design problem with hub capacity constraints ⋮ Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems ⋮ Configuration‐based approach for topological problems in the design of wireless sensor networks ⋮ Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time ⋮ Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm ⋮ Scalable timing-aware network design via Lagrangian decomposition ⋮ Dynamic scheduling of patients in emergency departments ⋮ A branch-and-price algorithm for the aperiodic multi-period service scheduling problem ⋮ Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Exact solution of network flow models with strong relaxations ⋮ Mathematical model applied to single-track line scheduling problem in Brazilian railways ⋮ The time dependent traveling salesman problem: polyhedra and algorithm ⋮ Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty ⋮ Column generation for extended formulations ⋮ Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation ⋮ A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching ⋮ An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events ⋮ Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times ⋮ Perspectives on integer programming for time-dependent models ⋮ Exact algorithms for the traveling salesman problem with draft limits ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization ⋮ A minmax regret version of the time-dependent shortest path problem ⋮ Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads ⋮ The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem ⋮ Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria ⋮ A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties ⋮ Modeling single machine preemptive scheduling problems for computational efficiency ⋮ A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems ⋮ A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem ⋮ A branch-and-price procedure for clustering data that are graph connected ⋮ New exact techniques applied to a class of network flow formulations ⋮ Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
- On the choice of explicit stabilizing terms in column generation
- A time indexed formulation of non-preemptive single machine scheduling problems
- Stabilized column generation
- A polyhedral approach to single-machine scheduling problems.
- An exact algorithm for single-machine scheduling without machine idle time
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- Time-Indexed Formulations and the Total Weighted Tardiness Problem
- New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- On a Generalization of the Master Cyclic Group Polyhedron
This page was built for publication: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
