A Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information

DOI10.1142/S0217595915500153zbMath1321.90039MaRDI QIDQ5265455

Wim Hordijk, Arie Hordijk, Bernd F. Heidergott

Publication date: 28 July 2015

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

zbMATH Keywords

controlordinal optimizationgenetic algorithmmulti-server queuebilliard sequence

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: A Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information