Recommendations
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1488097 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- A Note on the Relation between the Product Rate Variation (PRV) Problem and the Apportionment Problem
- A Parametric Multi-start Algorithm for Solving the Response Time Variability Problem
- A branch and bound algorithm for the response time variability problem
- A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems
- A probabilistic heuristic for a computationally difficult set covering problem
- A survey on problems and methods in generalized assembly line balancing
- An Introduction to Tabu Search
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- Future paths for integer programming and links to artificial intelligence
- Genetic Algorithms
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Hybridizing the cross-entropy method: An application to the max-cut problem
- Hyper-heuristic approaches for the response time variability problem
- Improving the location of minimax facilities through network modification
- Mathematical programming modeling of the response time variability problem
- Min-max optimization of several classical discrete optimization problems
- Minimizing variation of production rates in just-in-time systems: A survey
- Optimization by simulated annealing
- Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
- Proportional optimization and fairness
- Response time variability
- Scheduling Commercial Videotapes in Broadcast Television
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
- Solving the response time variability problem by means of a genetic algorithm
- The scheduling of maintenance service
- Using aggregation to reduce response time variability in cyclic fair sequences
- Using experimental design to find effective parameter settings for heuristics
- Variable neighborhood search
Cited in
(4)
This page was built for publication: Minimising maximum response time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336510)