Quality inspection scheduling for multi-unit service enterprises

DOI10.1016/J.EJOR.2007.12.006zbMath1158.90343OpenAlexW2025840257MaRDI QIDQ953432

Arthur E. Carter, Cliff T. Ragsdale

Publication date: 20 November 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.12.006

zbMATH Keywords

schedulingtraveling salesmangenetic algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

Hybrid search with neighborhood reduction for the multiple traveling salesman problem

Cites Work

• Genetic algorithms and traveling salesman problems
• A genetic algorithm for service level based vehicle scheduling
• Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
• Genetic algorithm crossover operators for ordering applications
• A hybrid genetic algorithm for the open shop scheduling problem
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quality inspection scheduling for multi-unit service enterprises