The following pages link to On general routing problems (Q4143017):
Displaying 50 items.
- An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- Mixed integer non-linear programming models for green network design (Q339579) (← links)
- An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
- On the collaboration uncapacitated arc routing problem (Q342264) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
- Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times (Q706971) (← links)
- V-shop scheduling (Q795725) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- A tabu search algorithm for the single machine total weighted tardiness problem (Q853020) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up (Q859684) (← links)
- Solving a generalized traveling salesperson problem with stochastic customers (Q868135) (← links)
- Considering scheduling and preventive maintenance in the flowshop sequencing problem (Q883296) (← links)
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem (Q909574) (← links)
- Job oriented production scheduling (Q915631) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537) (← links)
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions (Q964850) (← links)
- A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times (Q967801) (← links)
- Scheduling multiple orders per job in a single machine to minimize total completion time (Q992578) (← links)
- Some no-wait shops scheduling problems: Complexity aspect (Q1079487) (← links)
- A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints (Q1089245) (← links)
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan (Q1091256) (← links)
- New trends in machine scheduling (Q1107428) (← links)
- Real-time scheduling of an automated manufacturing center (Q1116883) (← links)
- Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem (Q1117832) (← links)
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem (Q1120271) (← links)
- A new integer programming formulation for the permutation flowshop problem (Q1121163) (← links)
- Minimizing the number of tardy jobs for \(m\) parallel machines (Q1127174) (← links)
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem (Q1129955) (← links)
- Flowshop sequencing with mean flowtime objective (Q1130072) (← links)
- An adaptive branching rule for the permutation flow-shop problem (Q1141078) (← links)
- On the measurement of complexity in activity networks (Q1145062) (← links)
- Scheduling multi-operational tasks on nonidentical machines as a time- optimal control problem (Q1162438) (← links)
- The complexity of shop-scheduling problems with two or three jobs (Q1178530) (← links)
- Stability of an optimal schedule (Q1183618) (← links)
- Production scheduling problems in a textile industry (Q1194728) (← links)
- Efficient heuristics to minimize total flow time with release dates (Q1195875) (← links)
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646) (← links)
- Task scheduling with interprocessor communication delays (Q1197669) (← links)
- An approximation algorithm for the general routing problem (Q1197996) (← links)
- On the complexity of generating synchronizable test sequences (Q1203646) (← links)
