Formulating and solving production planning problems
From MaRDI portal
Publication:1806882
DOI10.1016/S0377-2217(97)00394-9zbMATH Open0948.90052MaRDI QIDQ1806882FDOQ1806882
Authors: Avraham Shtub, G. (Anand) Anandalingam, Larry J. Le Blanc 
Publication date: 20 December 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Production planning problems in flexible manufacturing systems
- scientific article; zbMATH DE number 2084779
- Production planning
- A production planning problem in FMS
- A production planning problem in FMS
- Production planning of a manufacturing industry using linear programming
- An integrated approach in production planning and scheduling
- Production Planning by Mixed Integer Programming
- scientific article; zbMATH DE number 3900467
Cites Work
- Title not available (Why is that?)
- Optimization by Simulated Annealing
- Equation of State Calculations by Fast Computing Machines
- Convergence of an annealing algorithm
- A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
- Genetic algorithm based approach to bi-level linear programming
- A genetic algorithm for flowshop sequencing
- Cooling Schedules for Optimal Annealing
- An Algorithm for Large Zero-One Knapsack Problems
- Algorithms for the Multi-Resource Generalized Assignment Problem
- A branch and bound algorithm for the generalized assignment problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Methods for the one-dimensional space allocation problem
- An improved annealing scheme for the QAP
- An integer programming model for the allocation of databases in a distributed computer system
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- A simulated annealing approach for the one-machine mean tardiness scheduling problem
- An Efficient Algorithm for the 0-1 Knapsack Problem
- Title not available (Why is that?)
- Optimization of resource location in hierarchical computer networks
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
- Simulated annealing applied to the process allocation problem
- Optimal design of LAN-WAN internetworks: An approach using simulated annealing
- Optimizing Interconnections of Local Area Networks: An Approach Using Simulated Annealing
- Genetic learning of dynamic scheduling within a simulation environment
Cited In (6)
- Assignment problems: a golden anniversary survey
- Approximate reasoning for production planning
- Title not available (Why is that?)
- A Survey of the Generalized Assignment Problem and Its Applications
- Solving coupled task assignment and capacity planning problems for a job shop by using a concurrent genetic algorithm
- Automatic production planning of press brakes for sheet metal bending
This page was built for publication: Formulating and solving production planning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806882)
