✦ LIBER ✦

Efficient propagation and computation of problem features for activity-based scheduling

✍ Scribed by A. Winklhofer; M. Maierhofer; P. Levi

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 557 KB
Volume: 1
Category: Article
ISSN: 0967-0661
DOI: 10.1016/0967-0661(93)92119-o

No coin nor oath required. For personal study only.

✦ Synopsis

In this article an approach for activity-based scheduling is presented. This approach seems to be especially useful in cases of time and resource critical problems. Based on a timenet of activities, problem features which allow a focusing of the search will be computed through propagation, making a backtracking obsolete in most cases. In this paper, a method for propagation with polynomial complexity is introduced. Common methods either have had exponential complexity or were inaccurate. The activity-based scheduling can be applied with= in a production control system, doing the scheduling on the level of working on and mounting processes, and the capacity balancing according to fixed restrictions and preferences.

Kevwords. Job shop scheduling; optimization; constraint theory; heuristic programming.

📜 SIMILAR VOLUMES

Efficient propagation and computation of

Efficient propagation and computation of problem features for activity-based scheduling : A. Winlhofer, M. Maierhofer, P. Levi, pp 189–195

📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 124 KB

implement research results into the manufacturing systems of tomorrow. An important forum for the presentation and discussion of research results and advanced industrial implementations in the field of information technology in manufacturing was the 7th Symposium on Information Control Problems in

Computational performance and efficiency

Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem

✍ Timothy L. Urban 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 726 KB

Computation accuracy and efficiency of a

Computation accuracy and efficiency of a polynomial nodal method for diffusion and spatial burnup problems

✍ E. Brega; F.Di Pasquantonio; E. Salina 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 711 KB

Computational experience with a backtrac

Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems

✍ James H. Patterson; F. Brian Talbot; Roman Slowinski; Jan Wegłarz 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 895 KB

Computing costs for FEM analysis of foun

Computing costs for FEM analysis of foundation engineering problems and possible ways of increasing efficiency

✍ Hermann Schad 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 798 KB

The application of finite element methods (FEM) is often restricted by the available computer capacity and the computing costs. The purpose of this paper, therefore, is, to present test results and to discuss possible ways of achieving a substantial reduction in computing times. Dividing the numeric

MODEL—molecular descriptor lab: A web-ba

MODEL—molecular descriptor lab: A web-based server for computing structural and physicochemical features of compounds

✍ Z.R. Li; L.Y. Han; Y. Xue; C.W. Yap; H. Li; L. Jiang; Y.Z. Chen 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB 👁 2 views

## Abstract Molecular descriptors represent structural and physicochemical features of compounds. They have been extensively used for developing statistical models, such as quantitative structure activity relationship (QSAR) and artificial neural networks (NN), for computer prediction of the pharma