By Topic

Online Optimization through Preprocessing for Multi-stage Production Decision Guidance Queries

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Egge, N. ; Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA ; Brodsky, A. ; Griva, I.

We consider optimization problems expressed in Decision Guidance Query Language that may involve linear arithmetic constraints, as well as finite domain and binary variables, and focus on a class of Multi-Stage Production problems in which only a part of the problem is dynamic, i.e., the demand for the output product in a manufacturing process, whereas the rest of the problem is static, i.e., the connectivity graph of the assembly processes and the cost functions of machines. We propose the online-decomposition algorithm (ODA) based on offline preprocessing that optimizes each static problem component for discretized values of shared constraint variables, and approximate the optimal aggregated utility functions. ODA 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. We also conduct an initial experimental evaluation which shows that ODA, as compared with MILP, 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 preprocessing is possible.

Published in:

Data Engineering Workshops (ICDEW), 2012 IEEE 28th International Conference on

Date of Conference:

1-5 April 2012