Formulating and solving production planning problems
type: Item
instance of: scholarly article
title: Formulating and solving production planning problems
zbMATH Open document ID: 0948.90052
DOI: 10.1016/S0377-2217(97)00394-9
author: Avraham Shtub
author: G. (Anand) Anandalingam
author: Larry J. Le Blanc
published in: European Journal of Operational Research
publication date: 1999-12-20T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 1358451
zbMATH Keywords: genetic algorithm
zbMATH Keywords: simulated annealing
zbMATH Keywords: Lagrangian relaxation
MaRDI profile type: Publication
cites work: Genetic learning of dynamic scheduling within a simulation environment
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: A New Optimization Method for Large Scale Fixed Charge Transportation Problems
cites work: A simulated annealing approach for the one-machine mean tardiness scheduling problem
cites work: An improved annealing scheme for the QAP
cites work: Optimizing Interconnections of Local Area Networks: An Approach Using Simulated Annealing
cites work: Optimal design of LAN-WAN internetworks: An approach using simulated annealing
cites work: A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
cites work: Algorithms for the Multi-Resource Generalized Assignment Problem
cites work: Q4692508
cites work: Cooling Schedules for Optimal Annealing
cites work: Q3912314
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
cites work: Optimization by Simulated Annealing
cites work: Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
cites work: Convergence of an annealing algorithm
cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm
cites work: Genetic algorithm based approach to bi-level linear programming
cites work: Equation of State Calculations by Fast Computing Machines
cites work: An Efficient Algorithm for the 0-1 Knapsack Problem
cites work: An integer programming model for the allocation of databases in a distributed computer system
cites work: A genetic algorithm for flowshop sequencing
cites work: Methods for the one-dimensional space allocation problem
cites work: A branch and bound algorithm for the generalized assignment problem
cites work: Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
cites work: Simulated annealing applied to the process allocation problem
cites work: Optimization of resource location in hierarchical computer networks
cites work: Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
Recommended article: Production planning problems in flexible manufacturing systems
Recommended article: Q4735937
Recommended article: Q3061959
Recommended article: Q5323324
Recommended article: A production planning problem in FMS
Recommended article: Q5012315
Recommended article: An integrated approach in production planning and scheduling
Recommended article: Production Planning by Mixed Integer Programming
Recommended article: Q3678942
description: scientific article; zbMATH DE number 1358451