„Problem Management“

Suchergebnisse

10.000+ Treffer

• A parallel improved ant colony optimization for multi-depot vehicle routing problem
  Yu, B. ; Yang, Z-Z ; Xie, J-X
• A hybrid genetic algorithmic approach to the maximally diverse grouping problem
  Fan, Z P. ; Chen, Y. ; Ma, J. ; Zeng, S.
• A model for timetabling problems with period spread constraints
  Lara-Velázquez, P. ; López-Bracho, R. ; Ramírez-Rodríguez, J. ; Yáñez, J.
• A note: a due-window assignment problem on parallel identical machines
  Mosheiov, G. ; Sarig, A.
• Meta-heuristic algorithms for wafer sorting scheduling problems
  Lin, Shih-Wei ; Lee, Zne-Jung ; Ying, Kuo-Ching ; Lin, Rong-Ho
• New constructive heuristics for the total weighted tardiness problem
  Yoon, S H. ; Lee, I S.
• An adaptive tabu-simulated annealing for concave cost transportation problems
  Altiparmak, F. ; Karaoglan, I.
• The maximum return-on-investment plant location problem with market share
  Brimberg, J. ; Hansen, P. ; Laporte, G. ; Mladenovic, N. ; Urošević, D.
• VLSN search algorithms for partitioning problems using matching neighbourhoods
  Öncan, T. ; Kabadi, S N. ; Nair, K P K. ; Punnen, A P.
• Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
  Kuo, W-H ; Yang, D-L
• A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems
  Özpeynirci, S. ; Azizoğlu, M.
• Ethnography, ethnomethodology and the problem of generalisation in design
  Sharrock, Wes ; Randall, Dave
• A branch-and-cut algorithm for the plant-cycle location problem
  Labbé, M. ; Rodríguez-Martin, I. ; Salazar-González, J J.
• An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem
  Seong, Y-J ; G, Y-G ; Kang, M-K ; Kang, C-W
• Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
  Cordeau, J-F ; Laporte, G. ; Mercier, A.
• Problem structuring methods for large group interventions
  Shaw, D. ; Westcombe, M. ; Hodgkin, J. ; Montibeller, G.
• Intelligent Scheduling Problems
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
  Glover, F. ; Punnen, A P.
• A time-based formulation and upper bounding scheme for the selective travelling salesperson problem
  Millar, H H. ; Kiragu, M.
• Decision Aids for Selection Problems
  Olson, D L.