Theory of linear and integer programming
Theory of linear and integer programming
Modelica - A Unified Object-Oriented Language for System Modelling and Simulation
ECCOP '98 Proceedings of the 12th European Conference on Object-Oriented Programming
Queueing-model based analysis of assembly lines with finite buffers and general service times
Computers and Operations Research
HICSS '08 Proceedings of the Proceedings of the 41st Annual Hawaii International Conference on System Sciences
A decisions query language (DQL): high-level abstraction for mathematical programming over databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Reusing Relational Queries for Intuitive Decision Optimization
HICSS '11 Proceedings of the 2011 44th Hawaii International Conference on System Sciences
International Journal of Computer Integrated Manufacturing
CoJava: optimization modeling by nondeterministic simulation
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
The authors consider optimization problems expressed in Decision Guidance Query Language that may involve linear arithmetic constraints, as well as finite domain and binary variables. They focus on Distributed Manufacturing Network optimization problems in which only a part of the problem is dynamic, i.e., the demand for the output products in a manufacturing network, whereas the rest of the problem is static, i.e., the connectivity graph of the assembly processes and the cost functions of machines. The authors propose the Online Decomposition Algorithm based on offline preprocessing that optimizes each static problem component for discretized values of shared constraint variables, and approximate the optimal aggregated utility functions. The Online Decomposition Algorithm uses the pre-processed approximated aggregated cost functions to decompose the original problem into smaller problems, and utilizes search heuristics for the combinatorial part of the problem based on the pre-processed look-up tables. They also conduct an initial experimental evaluation which shows that the Online Decomposition Algorithm, as compared with Mixed Integer Linear Programming, provides an order of magnitude improvement in terms of both computational time and the quality of found solutions for a class of problems for which pre-processing is possible.