Lucio Bianco, Massimiliano Caramia: A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations.14-20
John E. Hebert, Richard F. Deckro: Combining contemporary and traditional project management tools to resolve a project scheduling problem.21-32
Francisco Ballestín, Rosa Blanco: Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems.51-62
Hasan Bal, H. Hasan Örkcü: A new mathematical programming approach to multi-group classification problems.105-111
B. Madhu Rao: A decision support model for warranty servicing of repairable items.112-130
Sebastián Lozano, Ester Gutiérrez: Slacks-based measure of efficiency of airports with airplanes delays as undesirable outputs.131-139
José Brandão: A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem.140-151
Xiangyong Li, Md. Fazle Baki, Yash P. Aneja: Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic.152-164
Seyda Topaloglu, Irem Ozkarahan: A constraint programming-based solution approach for medical resident scheduling problems.246-255
Parag C. Pendharkar: A hybrid radial basis function and data envelopment analysis neural network for classification.256-266
Wei Li, Barrie R. Nault, Deyi Xue, Yiliu Tu: An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production.267-276
Ibrahim Akgün: New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints.277-286
Abel García-Nájera, John A. Bullinaria: An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows.287-300
Luis Fanjul-Peyro, Rubén Ruiz: Size-reduction heuristics for the unrelated parallel machines scheduling problem.301-309
Christian Blum, Cristóbal Miralles: On solving the assembly line worker assignment and balancing problem via beam search.328-339
Eugene Edison, Tal Shima: Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms.340-356
Federico Liberatore, Maria Paola Scaparra, Mark S. Daskin: Analysis of facility protection strategies against an uncertain number of attacks: The stochastic R-interdiction median problem with fortification.357-366
Fabrice Talla Nobibon, Roel Leus: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment.367-378
Stefano Benati: Heuristic methods for the optimal statistic median problem.379-386
Stefan Gollowitzer, Ivana Ljubic: MIP models for connected facility location: A theoretical and computational study.435-449
Alper Murat, Vedat Verter, Gilbert Laporte: A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand.450-463
Jin-Xiao Chen, Mingrong Deng, Sylvain Gingras: A modified super-efficiency measure based on simultaneous input-output projection in data envelopment analysis.496-504
Edward Bernroider, Nikolaus Obwegeser, Volker Stix: Analysis of heuristic validity, efficiency and applicability of the profile distance method for implementation in decision support systems.816-823
Rommel G. Regis: Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions.837-853
Rui Zhang, Cheng Wu: A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective.854-867
Dong Tang, Udatta S. Palekar: Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms.942-953
S. R. Balseiro, Irene Loiseau, J. Ramonet: An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows.954-966
Kerem Bülbül: A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem.967-983
Brijesh Paul, Chandrasekharan Rajendran: Rationing mechanisms and inventory control-policy parameters for a divergent supply chain operating with lost sales and costs of review.1117-1130
Jennifer Pryor, John W. Chinneck: Faster integer-feasibility in mixed-integer linear programs by branching to force change.1143-1152
Jordi Pereira, Igor Averbakh: Exact and heuristic algorithms for the interval data robust assignment problem.1153-1163
Ali Mohammad Nezhad, Hashem Mahlooji: A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems.1164-1174
Yi-Kuei Lin, Cheng-Ta Yeh: Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget.1175-1187
Wen-Min Lu, Shiu-Wan Hung: Exploring the efficiency and effectiveness in global e-retailing companies.1351-1360
M. Duran Toksari: A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs.1361-1365
Oded Berman, Dmitry Krass, Jiamin Wang: The probabilistic gradual covering location problem on a network with discrete random demand weights.1493-1500
Cristina Corchero, F.-Javier Heredia: A stochastic programming model for the thermal optimal day-ahead bid problem with physical futures contracts.1501-1512
Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic Scholar