Hybrid optimization methods for time-dependent sequencing problems
type: Item
instance of: scholarly article
title: Hybrid optimization methods for time-dependent sequencing problems
zbMATH Open document ID: 1402.90053
author: J. Kinable
author: Andre A. Cire
author: Willem-Jan van Hoeve
published in: European Journal of Operational Research
publication date: 2018-05-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6873645
zbMATH Keywords: constraint programming
zbMATH Keywords: sequencing
zbMATH Keywords: decision diagrams
zbMATH Keywords: additive bounding
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.11.035
OpenAlex ID: W2551102339
cites work: The time dependent traveling salesman problem: polyhedra and algorithm
cites work: A polyhedral approach to single-machine scheduling problems.
cites work: An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
cites work: Q3425132
cites work: New state-space relaxations for solving the traveling salesman problem with time windows
cites work: Improved filtering for weighted circuit constraints
cites work: Single-machine scheduling with learning considerations
cites work: The minimum latency problem
cites work: Multivalued Decision Diagrams for Sequencing Problems
cites work: In Pursuit of the Traveling Salesman
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems
cites work: Q4198056
cites work: Time-dependent routing problems: a review
cites work: Natural and extended formulations for the time-dependent traveling salesman problem
cites work: Load-dependent and precedence-based models for pickup and delivery problems
cites work: A classification of formulations for the (time-dependent) traveling salesman problem
cites work: The delivery man problem with time windows
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: Integrated methods for optimization
cites work: Machine scheduling problems with a position-dependent deterioration
cites work: Makespan minimization in single-machine scheduling with step-deterioration of processing times
cites work: An Alternative Family of Transformations
cites work: Discrepancy-based additive bounding procedures
cites work: Time‐dependent traveling salesman problem–the deliveryman case
cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
cites work: A new formulation for the traveling deliveryman problem
cites work: Facets and valid inequalities for the time-dependent travelling salesman problem
cites work: An integer programming approach for the time-dependent TSP
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: Scheduling
cites work: Global Constraints: A Survey
cites work: Scheduling problems with position dependent job processing times: computational complexity results
cites work: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
cites work: Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem
cites work: Some scheduling problems with general position-dependent and time-dependent learning effects
DOI: 10.1016/J.EJOR.2016.11.035
Recommended article: Insertion sequence variables for hybrid routing and scheduling problems
Recommended article: Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
Recommended article: A hybrid particle swarm optimization approach for the sequential ordering problem
Recommended article: Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
Recommended article: Q4369123
Recommended article: Optimal Sequencing in Multiserver Systems
description: scientific article; zbMATH DE number 6873645