Formulating and solving production planning problems

DOI10.1016/S0377-2217(97)00394-9zbMath0948.90052MaRDI QIDQ1806882

G. Anandalingam, Avraham Shtub, Larry J. Le Blanc

Publication date: 20 December 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationsimulated annealinggenetic algorithm

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Production models (90B30)

Related Items (2)

Assignment problems: a golden anniversary survey ⋮ A Survey of the Generalized Assignment Problem and Its Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Optimization of resource location in hierarchical computer networks
• An improved annealing scheme for the QAP
• Methods for the one-dimensional space allocation problem
• An integer programming model for the allocation of databases in a distributed computer system
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
• Optimal design of LAN-WAN internetworks: An approach using simulated annealing
• Simulated annealing applied to the process allocation problem
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
• A simulated annealing approach for the one-machine mean tardiness scheduling problem
• Genetic learning of dynamic scheduling within a simulation environment
• A genetic algorithm for flowshop sequencing
• Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Convergence of an annealing algorithm
• Cooling Schedules for Optimal Annealing
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• An Algorithm for Large Zero-One Knapsack Problems
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• Algorithms for the Multi-Resource Generalized Assignment Problem
• A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
• Optimizing Interconnections of Local Area Networks: An Approach Using Simulated Annealing
• A branch and bound algorithm for the generalized assignment problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Genetic algorithm based approach to bi-level linear programming
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: Formulating and solving production planning problems