A column generation approach to job grouping for flexible manufacturing systems
From MaRDI portal
Publication:1341988
DOI10.1016/0377-2217(94)90122-8zbMath0814.90036OpenAlexW1983469625MaRDI QIDQ1341988
Alwin G. Oerlemans, Yves Cramer
Publication date: 9 February 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90122-8
Related Items
Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems, Tool-feeder partitions for module assignment in PCB assembly, Sequencing of parts on single-stage multifunctional machining systems using a chaos-embedded simulated annealing algorithm, Storage management of items in two levels of availability, Berge-acyclic multilinear 0-1 optimization problems, Order picking along a crane-supplied pick face: the SKU switching problem, Order consolidation for batch processing, Minimizing the number of switch instances on a flexible machine in polynomial time, Combinatorial optimization models for production scheduling in automated manufacturing systems, A reduction technique for weighted grouping problems, Scheduling multi-colour print jobs with sequence-dependent setup times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving large set covering problems on a personal computer
- Order selection on a single machine with high set-up costs
- A linear programming approach to reasoning about probabilities
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- On the supermodular knapsack problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- OPTIMAL TOOL MODULE DESIGN PROBLEM FOR NC MACHINE TOOLS
- Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
- A loading and dispatching problem in a random flexible manufacturing system
- Routing with time windows by column generation
- A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
- Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
- Modelling and solving an FMS part selection problem
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Quadratic knapsack problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The NP-Completeness of Some Edge-Partition Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Column Generation Methods for Probabilistic Logic
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
