On general routing problems
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- Some no-wait shops scheduling problems: Complexity aspect
- A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- New trends in machine scheduling
- Real-time scheduling of an automated manufacturing center
- Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
- A new integer programming formulation for the permutation flowshop problem
- Minimizing the number of tardy jobs for m parallel machines
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- Flowshop sequencing with mean flowtime objective
- An adaptive branching rule for the permutation flow-shop problem
- On the measurement of complexity in activity networks
- Scheduling multi-operational tasks on nonidentical machines as a time- optimal control problem
- The complexity of shop-scheduling problems with two or three jobs
- Stability of an optimal schedule
- Production scheduling problems in a textile industry
- Efficient heuristics to minimize total flow time with release dates
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- Task scheduling with interprocessor communication delays
- An approximation algorithm for the general routing problem
- On the complexity of generating synchronizable test sequences
- Restricted neighborhood in the tabu search for the flowshop problem
- A sequencing problem in the weaving industry
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
- The job shop scheduling problem: Conventional and new solution techniques
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- Scheduling multiprocessor tasks with chain constraints
- New inequalities for the general routing problem
- The rural postman problem with deadline classes
- A tabu search approach for the flow shop scheduling problem
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
- Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
- Complexity of single machine, multi-criteria scheduling problems
- Some remarks about the `equivalence' of performance measures in scheduling problems
- The job shop tardiness problem: A decomposition approach
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- A decomposition approach for a resource constrained scheduling problem
- A polyhedral approach to the rural postman problem
- A decomposition approach in a DSS for a resource constrained scheduling problem
- A genetic algorithm for flowshop sequencing
- Evolution based learning in a job shop scheduling environment
- Optimal match-up strategies in stochastic scheduling
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
- Heuristic procedures for minimizing makespan and the number of required pallets
- Resource-constrained project scheduling: A survey of recent developments.
- A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
- A concise survey of scheduling with time-dependent processing times
- Min-max cover of a graph with a small number of parts
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Capacitated arc routing problem with deadheading demands
- A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- Constant-factor approximations for capacitated arc routing without triangle inequality
- A computational study of several heuristics for the DRPP
- The general routing polyhedron: A unifying framework
- A bicriteria approach to the two-machine flow shop scheduling problem
- Batch scheduling to minimize total completion time
- NP-hardness of shop-scheduling problems with three jobs
- A capacitated general routing problem on mixed networks
- A new view on rural postman based on Eulerian extension and matching
- Exact approaches for the cutting path determination problem
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- On Eulerian extensions and their application to no-wait flowshop scheduling
- Multi-family scheduling in a two-machine reentrant flow shop with setups
- Flow-shop scheduling with setup and assembly operations
- On the general routing polytope
- Computing finest mincut partitions of a graph and application to routing problems
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Mixed binary integer programming formulations for the reentrant job shop scheduling problem
- A note on the undirected rural postman problem polytope
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- Privatized rural postman problems
- A bicriteria scheduling with sequence-dependent setup times
- On the hierarchical Chinese postman problem with linear ordered classes
- A review of TSP based approaches for flowshop scheduling
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- Approximation algorithms for a mixed postman problem with restrictions on the arcs
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- Efficient algorithms for Eulerian extension
- From few components to an Eulerian graph by adding ARCS
- 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
- Mixed integer non-linear programming models for green network design
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- On the collaboration uncapacitated arc routing problem
- A decade of capacitated arc routing
- Modeling and solving the mixed capacitated general routing problem
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- scientific article; zbMATH DE number 4095196 (Why is no real title available?)
- Approximation algorithms for mixed, windy, and capacitated arc routing problems
- A branch-and-price algorithm for the windy rural postman problem
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
- Arc routing problems: A review of the past, present, and future
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
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)
