On general routing problems
From MaRDI portal
Publication:4143017
DOI10.1002/net.3230060305zbMath0366.90092OpenAlexW2080182237MaRDI QIDQ4143017
Alexander H. G. Rinnooy Kan, Jan Karel Lenstra
Publication date: 1976
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/9726
Related Items
Unnamed Item, 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, 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 a Mixed Postman Problem with Restrictions on the Arcs, Approximation algorithms for the min-max mixed rural postmen cover problem and its variants, Approximation algorithms for the min-max mixed rural postmen cover problem and its variants, Improving a constructive heuristic for the general routing problem, The single robot line coverage problem: Theory, algorithms, and experiments, Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems, A branch-and-price algorithm for the windy rural postman problem, A Decade of Capacitated Arc Routing, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, Privatized rural postman problems, Efficient Algorithms for Eulerian Extension, A bicriteria scheduling with sequence-dependent setup times, From Few Components to an Eulerian Graph by Adding Arcs, On the hierarchical Chinese postman problem with linear ordered classes, A review of TSP based approaches for flowshop scheduling, Some no-wait shops scheduling problems: Complexity aspect, A decomposition approach for a resource constrained scheduling problem, A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan, A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints, An effective differential evolution algorithm for permutation flow shop 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, Scheduling jobs with release dates and tails on identical machines to minimize the makespan, Batch scheduling to minimize total completion time, Optimal match-up strategies in stochastic scheduling, NP-hardness of shop-scheduling problems with three jobs, A capacitated general routing problem on mixed networks, Rural postman parameterized by the number of components of required edges, Two-phase branch-and-cut for the mixed capacitated general routing problem, A tabu search algorithm for the single machine total weighted tardiness problem, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, A discrete inter-species cuckoo search for flowshop scheduling problems, New trends in machine scheduling, Mixed integer non-linear programming models for green network design, An investigation on a two-agent single-machine scheduling problem with unequal release dates, CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up, On the collaboration uncapacitated arc routing problem, A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem, Solving a generalized traveling salesperson problem with stochastic customers, 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, 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, Minimizing the number of tardy jobs for \(m\) parallel machines, Considering scheduling and preventive maintenance in the flowshop sequencing problem, Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem, Flowshop sequencing with mean flowtime objective, Heuristic procedures for minimizing makespan and the number of required pallets, A new view on rural postman based on Eulerian extension and matching, An adaptive branching rule for the permutation flow-shop problem, On the measurement of complexity in activity networks, 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, On Eulerian extensions and their application to no-wait flowshop scheduling, The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem, Job oriented production scheduling, Scheduling multi-operational tasks on nonidentical machines as a time- optimal control problem, A state-of-the-art review of parallel-machine scheduling research, The complexity of shop-scheduling problems with two or three jobs, Stability of an optimal schedule, A deterministic tabu search algorithm for the capacitated arc routing problem, Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics, Multi-family scheduling in a two-machine reentrant flow shop with setups, Flow-shop scheduling with setup and assembly operations, Production scheduling problems in a textile industry, Efficient heuristics to minimize total flow time with release dates, On the general routing polytope, Computing finest mincut partitions of a graph and application to routing problems, Min-max cover of a graph with a small number of parts, 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, Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions, A sequencing problem in the weaving industry, An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem, Capacitated arc routing problem with deadheading demands, Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan, A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop, A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times, Mixed binary integer programming formulations for the reentrant job shop scheduling problem, Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE, Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times, A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem, A note on the undirected rural postman problem polytope, Constant-factor approximations for capacitated arc routing without triangle inequality, Scheduling multiple orders per job in a single machine to minimize total completion time, A computational study of several heuristics for the DRPP, The general routing polyhedron: A unifying framework, 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, A bicriteria approach to the two-machine flow shop scheduling 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, Exact approaches for the cutting path determination problem, A tabu search approach for the flow shop scheduling problem, The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra, V-shop scheduling, 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, Mathematical programming formulations for machine scheduling: A survey
Cites Work
