On general routing problems
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- Production scheduling problems in a textile industry
- Task scheduling with interprocessor communication delays
- A tabu search approach for the flow shop scheduling problem
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- V-shop scheduling
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- Privatized rural postman problems
- A sequencing problem in the weaving industry
- Batch scheduling to minimize total completion time
- Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
- Evolution based learning in a job shop scheduling environment
- Scheduling multi-operational tasks on nonidentical machines as a time- optimal control problem
- Computational complexity of the police officer patrol problem on weighted digraphs
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- A computational study of several heuristics for the DRPP
- On Eulerian extensions and their application to no-wait flowshop scheduling
- On the general routing polytope
- Min-max cover of a graph with a small number of parts
- A note on the undirected rural postman problem polytope
- Capacitated arc routing problem with deadheading demands
- Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem
- Restricted neighborhood in the tabu search for the flowshop problem
- Approximation algorithms for a mixed postman problem with restrictions on the arcs
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
- A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints
- Heuristic procedures for minimizing makespan and the number of required pallets
- Multi-family scheduling in a two-machine reentrant flow shop with setups
- The multidepot drone general routing problem with duration and capacity constraints
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
- An adaptive large neighborhood search method for the drone-truck arc routing problem
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
- Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times
- An approximation algorithm for the general routing problem
- Scheduling multiple orders per job in a single machine to minimize total completion time
- Mixed binary integer programming formulations for the reentrant job shop scheduling problem
- Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem
- A branch-and-price algorithm for the windy rural postman problem
- On the measurement of complexity in activity networks
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- A review of TSP based approaches for flowshop scheduling
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Minimizing the number of tardy jobs for m parallel machines
- A new integer programming formulation for the permutation flowshop problem
- A state-of-the-art review of parallel-machine scheduling research
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- Mathematical programming formulations for machine scheduling: A survey
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A new view on rural postman based on Eulerian extension and matching
- A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
- A decade of capacitated arc routing
- Job oriented production scheduling
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- On the hierarchical Chinese postman problem with linear ordered classes
- Arc routing problems: A review of the past, present, and future
- A decomposition approach for a resource constrained scheduling problem
- Complexity of single machine, multi-criteria scheduling problems
- The single robot line coverage problem: Theory, algorithms, and experiments
- A genetic algorithm for flowshop sequencing
- Rural postman parameterized by the number of components of required edges
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- A discrete inter-species cuckoo search for flowshop scheduling problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Resource-constrained project scheduling: A survey of recent developments.
- An adaptive branching rule for the permutation flow-shop problem
- Modeling and solving the mixed capacitated general routing problem
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Some remarks about the `equivalence' of performance measures in scheduling problems
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- scientific article; zbMATH DE number 4095196 (Why is no real title available?)
- Scheduling multiprocessor tasks with chain constraints
- The job shop tardiness problem: A decomposition approach
- Constant-factor approximations for capacitated arc routing without triangle inequality
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- The rural postman problem with deadline classes
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
- Flow-shop scheduling with setup and assembly operations
- Computing finest mincut partitions of a graph and application to routing problems
- A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
- NP-hardness of shop-scheduling problems with three jobs
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
- Mixed integer non-linear programming models for green network design
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- New trends in machine scheduling
- A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times
- Time-dependent windy rural postman problem: mathematical formulation and adaptive metaheuristic
- Solving a generalized traveling salesperson problem with stochastic customers
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- Stability of an optimal schedule
- Exact approaches for the cutting path determination problem
- The complexity of shop-scheduling problems with two or three jobs
- Real-time scheduling of an automated manufacturing center
- On the collaboration uncapacitated arc routing problem
- A deterministic tabu search algorithm for the capacitated arc routing problem
This page was built for publication: On general routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4143017)
