Hybrid optimization methods for time-dependent sequencing problems
From MaRDI portal
Publication:1751901
DOI10.1016/J.EJOR.2016.11.035zbMATH Open1402.90053OpenAlexW2551102339MaRDI QIDQ1751901FDOQ1751901
Authors: J. Kinable, Andre A. Cire, Willem-Jan van Hoeve 
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.11.035
Recommendations
- Insertion sequence variables for hybrid routing and scheduling problems
- Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
- A hybrid particle swarm optimization approach for the sequential ordering problem
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- scientific article; zbMATH DE number 1098939
- Optimal Sequencing in Multiserver Systems
Cites Work
- The traveling salesman problem. A computational study.
- An Alternative Family of Transformations
- Title not available (Why is that?)
- A classification of formulations for the (time-dependent) traveling salesman problem
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Multivalued decision diagrams for sequencing problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Integrated methods for optimization
- Improved filtering for weighted circuit constraints
- Scheduling
- The time dependent traveling salesman problem: polyhedra and algorithm
- The minimum latency problem
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- An integer programming approach for the time-dependent TSP
- The Delivery Man Problem and Cumulative Matroids
- Single-machine scheduling with learning considerations
- A polyhedral approach to single-machine scheduling problems.
- Scheduling problems with position dependent job processing times: computational complexity results
- Load-dependent and precedence-based models for pickup and delivery problems
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- Time‐dependent traveling salesman problem–the deliveryman case
- Some scheduling problems with general position-dependent and time-dependent learning effects
- New state-space relaxations for solving the traveling salesman problem with time windows
- The delivery man problem with time windows
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Time-dependent routing problems: a review
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Natural and extended formulations for the time-dependent traveling salesman problem
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- A new formulation for the traveling deliveryman problem
- Discrepancy-based additive bounding procedures
- Global Constraints: A Survey
- Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem
- Facets and valid inequalities for the time-dependent travelling salesman problem
- Machine scheduling problems with a position-dependent deterioration
Cited In (25)
- Incorporating bounds from decision diagrams into integer programming
- On one routing problem modeling movement in radiation fields
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems
- Constraint programming and operations research
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
- CP methods for scheduling and routing with time-dependent task costs
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
- Models and algorithms for the traveling salesman problem with time-dependent service times
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
- Solving a routing problem with the aid of an independent computations scheme
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- Sequencing mixed-model assembly lines with demand management: problem development and efficient multi-objective algorithms
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
- Title not available (Why is that?)
- Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Algorithms for mixed-model sequencing with due date restrictions
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
- Title not available (Why is that?)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups
This page was built for publication: Hybrid optimization methods for time-dependent sequencing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751901)
