EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Benchmark problems"
Narrow search

Narrow search

Year of publication
Subject
All
Benchmark problems 5 Scheduling problem 3 Scheduling-Verfahren 3 Algorithm 2 Algorithmus 2 Computation time 2 Durchlaufzeit 2 Heuristics 2 Heuristik 2 Lead time 2 Metaheuristics 2 Parallel machines 2 Swarm systems 2 Theorie 2 Theory 2 Benchmarking 1 Butterfly adjusting operator 1 Congestion 1 Crossover 1 Evolutionary algorithm 1 Evolutionärer Algorithmus 1 Ganzzahlige Optimierung 1 Greedy strategy 1 Integer programming 1 Job shop scheduling 1 Mathematical programming 1 Mathematische Optimierung 1 Migration 1 Monarch butterfly optimization 1 NEH heuristic 1 Production control 1 Produktionssteuerung 1 Teaching-learning-based optimization 1 Time dependent travel time 1 Variable speed 1 Vehicle routing 1 benchmark problems 1 makespan 1 permutation flow shop 1
more ... less ...
Online availability
All
Undetermined 3
Type of publication
All
Article 6
Type of publication (narrower categories)
All
Article in journal 4 Aufsatz in Zeitschrift 4
Language
All
English 4 Undetermined 2
Author
All
Rossi, Andrea 2 Andres Figliozzi, Miguel 1 Baskar, A. 1 Cui, Zhihua 1 Deb, Suash 1 Keesari, H. S. 1 Rao, R. Venkata 1 Wang, Gai-Ge 1 Zhao, Xinchao 1
more ... less ...
Published in...
All
International Journal of Production Economics 1 International journal of production economics 1 International journal of services and operations management 1 Operational research : an international journal 1 Opsearch : journal of the Operational Research Society of India 1 Transportation Research Part E: Logistics and Transportation Review 1
Source
All
ECONIS (ZBW) 4 RePEc 2
Showing 1 - 6 of 6
Cover Image
Analysing NEH and a few other similar permutation flow shop scheduling heuristics using Taillard's and Vallada's benchmarking problems
Baskar, A. - In: International journal of services and operations management 30 (2018) 1, pp. 72-97
Persistent link: https://www.econbiz.de/10011878420
Saved in:
Cover Image
A new monarch butterfly optimization with an improved crossover operator
Wang, Gai-Ge; Deb, Suash; Zhao, Xinchao; Cui, Zhihua - In: Operational research : an international journal 18 (2018) 3, pp. 731-755
Persistent link: https://www.econbiz.de/10011917430
Saved in:
Cover Image
Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships
Rossi, Andrea - In: International journal of production economics 153 (2014), pp. 253-267
Persistent link: https://www.econbiz.de/10010385210
Saved in:
Cover Image
Optimization of job shop scheduling problems using reaching-learning-based optimization algorithm
Keesari, H. S.; Rao, R. Venkata - In: Opsearch : journal of the Operational Research Society … 51 (2014) 4, pp. 545-561
Persistent link: https://www.econbiz.de/10010508653
Saved in:
Cover Image
Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships
Rossi, Andrea - In: International Journal of Production Economics 153 (2014) C, pp. 253-267
evaluated by modifying the well-known benchmark problems for job shop scheduling. Comparison with other systems and lower bounds … of benchmark problems has been performed. Statistical tests highlight how the approach is very promising. The performance …
Persistent link: https://www.econbiz.de/10010776679
Saved in:
Cover Image
The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics
Andres Figliozzi, Miguel - In: Transportation Research Part E: Logistics and … 48 (2012) 3, pp. 616-636
An algorithm that can tackle time dependent vehicle routing problems with hard or soft time windows without any alteration in its structure is presented. Analytical and experimental results indicate that average computational time increases proportionally to the number of customers squared. New...
Persistent link: https://www.econbiz.de/10010755050
Saved in:
A service of the
zbw
FAQ-Assistent (beta)
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...