A linear programming-based method for job shop scheduling

We present a decomposition heuristic for a large class of job shop scheduling problems. This heuristic utilizes information from the linear programming formulation of the associated optimal timing problem to solve subproblems, can be used for any objective function whose associated optimal timing problem can be expressed as a linear program (LP), and is particularly effective for objectives that include a component that is a function of individual operation completion times. Using the proposed heuristic framework, we address job shop scheduling problems with a variety of objectives where intermediate holding costs need to be explicitly considered. In computational testing, we demonstrate the performance of our proposed solution approach

Statistical analysis of catalyst degradation in a semi-continuous chemical production process

The effect of decaying catalyst efficacy in a commercial-scale, semi-continuous petrochemical process was investigated. The objective was to gain a better understanding of process behaviour and its effect on production rate. The process includes a three-stage reaction performed in fixed bed reactors. Each of the three reaction stages consists of a number of catalyst beds that are changed periodically to regenerate the catalyst. Product separation and reactant recycling are then performed in a series of distillation columns. In the absence of specific measurements of the catalyst properties, process operational data are used to assess catalyst decay. A number of statistical techniques were used to model production rate as a function of process operation, including information on short- and long-term catalyst decay. It was found that ridge regression, partial least squares and stepwise selection multiple linear regression yielded similar predictive models. No additional benefit was found from the application of non-linear partial least squares or Curds and Whey. Finally, through time series profiles of total daily production volume, corresponding to individual in-service cycles of the different reaction stages, short-term catalyst degradation was assessed. It was shown that by successively modelling the process as a sequence of batches corresponding to cycles of each reaction stage, considerable economic benefit could be realized by reducing the maximum cycle length in the third reaction stage. Copyright © 2001 John Wiley & Sons, Ltd

Price-Setting Combinatorial Auctions for Coordination and Control of Manufacturing Multiagent Systems: Updating Prices Methods

International audienceCombinatorial auctions are used as a distributed coordination mechanism in Multiagent Systems. The use of combinatorial auctions as negotiation and coordination mechanism is especially appropriate in systems with interdependencies and complementarities such as manufacturing scheduling systems. In this work we review some updating price mechanisms for combinatorial auctions based on the Lagrangian Relaxation Method. We focus our research to solve the optimization scheduling problem in the shop floor, taking into account the objectives of resource allocation in dynamic environments, i.e. -robustness, stability, adaptability, and efficiency-