Quality inspection scheduling for multi-unit service enterprises

DOI10.1016/J.EJOR.2007.12.006MaRDI QIDQ953432zbMATH OpenOpenAlexFDO

Authors 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

genetic algorithmsschedulingtraveling salesman

Mathematics Subject Classification ID

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

Recommendations

• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
• Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
• scientific article; zbMATH DE number 3848953

Cites work

• scientific article; zbMATH DE number 4104743 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 558543 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 4115948 (Why is no real title available?)
• A genetic algorithm for service level based vehicle scheduling
• A hybrid genetic algorithm for the open shop scheduling problem
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints
• Genetic algorithm crossover operators for ordering applications
• Genetic algorithms and traveling salesman problems
• Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study

Cited in

(1)

• Hybrid search with neighborhood reduction for the multiple traveling salesman problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953432)