A genetic algorithm for finding good balanced sequences in a customer assignment problem with no state information

DOI10.1142/S0217595915500153MaRDI QIDQ5265455zbMATH OpenFDO

Authors Wim Hordijk, Arie Hordijk, Bernd Heidergott

Publication date 28 July 2015

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595915500153

zbMATH Keywords

billiard sequencecontrolgenetic algorithmmulti-server queueordinal optimization

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Optimal balanced control for call centers
• On the optimal allocation of customers that must depart in sequence
• A genetic approach to the quadratic assignment problem
• A genetic algorithm for the generalised assignment problem

Cites work

• \(m\)-balanced words: A generalization of balanced words
• A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues
• An ordinal optimization based evolution strategy to schedule complex make-to-order products
• Balanced sequences and optimal routing
• Complexity of sequences defined by billiard in the cube
• Discrete-event control of stochastic networks: multimodularity and regularity.
• Extremal Splittings of Point Processes
• scientific article; zbMATH DE number 1348599 (Why is no real title available?)
• scientific article; zbMATH DE number 1131224 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Multimodularity, convexity, and optimization properties
• On the Assignment of Customers to Parallel Queues
• On the Average Waiting Time for Regular Routing to Deterministic Queues
• Optimal balanced control for call centers
• Ordinal Optimization
• Periodic routing to parallel queues and billiard sequences
• Quantifying heuristics in the ordinal optimization framework
• Regular ordering and applications in control policies
• Symbolic Dynamics II. Sturmian Trajectories
• Time-Sharing Policies for Controlled Markov Chains

This page was built for publication: A genetic algorithm for finding good balanced sequences in a customer assignment problem with no state information

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