1992
Authors
Sousa Jorge, P; Wolsey Laurence, A;
Publication
Mathematical Programming, Series A
Abstract
We consider the formulation of non-preemptive single machine scheduling problems using time-indexed variables. This approach leads to very large models, but gives better lower bounds than other mixed integer programming formulations. We derive a variety of valid inequalities, and show the role of constraint aggregation and the knapsack problem with generalised upper bound constraints as a way of generating such inequalities. A cutting plane/branch-and-bound algorithm based on these inequalities has been implemented. Computational experience on small problems with 20/30 jobs and various constraints and objective functions is presented.
1990
Authors
OLIVEIRA, JF; FERREIRA, JS;
Publication
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Abstract
This paper deals with the two-dimensional cutting problem in which the pieces involved in the cutting process are rectangles and the number of times a piece may appear in a cutting pattern is bounded. A modified algorithm, which is an improved version of Wang's algorithm, is presented. The computational performance of both algorithms is illustrated and compared by tests applied to a large number of randomly generated problems. The algorithms were implemented in a microcomputer. © 1990.
1990
Authors
Soeiro Ferreira, J; António Neves, M; Fonseca e Castro, P;
Publication
European Journal of Operational Research
Abstract
1990
Authors
FERREIRA, JAS;
Publication
OPTIMAL CONTROL APPLICATIONS & METHODS
Abstract
This paper presents an application of the maximum principle and the generalized maximum principle (a recent extension of that principle) to a discrete-time model of consumer choice behaviour. The model includes two brands in a market and uses a non-stationary first-order Markov chain. The optimization is carried out by algorithms based on the above mentioned principles. These algorithms are described, and their performances are discussed and compared both with and without fulfilment of the directional convexity property.
1990
Authors
FERREIRA, JS; NEVES, MA; CASTRO, PF;
Publication
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Abstract
A two-phase roll cutting problem appearing in the iron and steel industry is considered in this paper. It consists of optimizing the planning of roll cutting that, for technological reasons, is effected in two phases, i.e., each raw material roll is cut into intermediate primary rolls, which in turn are cut to obtain the constituent rolls of the final product. Apart from an inherent complexity to the cutting problem resulting from the large variety of final product dimensions, other supplementary difficulties also exist. These are related to the existence of numerous restrictions involved in the whole process and the link between the two cutting phases. A heuristic was developed and tested, that is based on an automatic sequential search with defined objectives, so as to obtain a good compromise between pattern usage and trim loss, respecting the various technological impositions. Finally, a real example taken from the steel industry together with the solution obtained from a computerized version developed for microcomputers, is presented. © 1990.
1989
Authors
Parreira, CM; Soeiro Ferreira, JA;
Publication
Engineering Optimization
Abstract
A problem consisting of the optimal design of a segmented wall on a surface having a nonlinear slope contour is considered. It is formulated as an optimal control problem and a solution procedure based on the Discrete Maximum Principle is developed. An application to a real case, which previously had been solved by a Dynamic Programming based method, is included together with some critical comments on the above-mentioned technique.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.