The worker/wrapper transformation is a general way of changing the type of a recursive definition, usually applied with an eye to increasing algorithmic efficiency. This note identifies an infelicity in the program transformations presented by Gill and Hutton (2009) and proposes a new totally correct worker/wrapper fusion rule.

In a multi-location, exchangeable-item repair system with spares, the expected waiting time and the fill rate measures are oftentimes used as the optimization criteria for the spares allocation problem. These measures, however, do not take into account that customers will tolerate a reasonable delay and therefore, the firm does not incur reputation costs if customers wait less than their tolera...

Chemical process synthesis methods and tools developed over the last several decades have reached a level of maturity that have provided advantage to practitioners in an environment of increased costs and shrinking margins. Future growth within the chemical process industries is likely to involve even keener competition with greater impact from factors such as raw material and energy availabili...

In this paper, we present the development and application of a Technical Feasibility Model (TFM) used in preliminary design to determine: whether or not a set of desired product specifications is technically feasible, and the optimality of those specifications with respect to the Pareto frontier. The TFM is developed by integrating the capabilities of a multidisciplinary design framework, a mul...

This work concerns a special class of multicriteria optimization problems, obtained from a given single-facility multicriteria planar location problem by adding several new cost functions. By means of a decomposition approach, based on the concept of Pareto reducibility, we have developed together with S. Alzorba and Chr. Günther an implementable algorithm for generating efficient solutions of ...

Nowadays, one of the main techniques used in heuristic planning is the generation of a relaxed planning graph, based on a Graphplan-like expansion. Planners like FF or MIPS use this type of graphs in order to compute distance-based heuristics during the planning process. This paper presents a new approach to extend the functionality of these graphs in order to manage numeric optimization criter...