An overview of some fuzzy set-based approaches to scheduling is proposed, emphasizing two distinct uses of fuzzy sets: representing preference profiles and modelling uncertainty distributions. The first setting leads to a valued, noncompensatory generalization of constraint-directed scheduling. The other setting yields a possibility-theoretic counterpart of PERT, where probability distributions...

CPM (Critical Path Method) dan PERT (Project Evaluation and Review Technique) merupakan teknik dalam matematika yang menggunakan prinsip jaringan untuk memprediksi durasi pelaksanaan sebuah proyek. Melalui kedua metode ini akan ditentukan kegiatan-kegiatan kritis dapat mempengaruhi ketepatan maupun keterlambatan dari penyelesaian suatu Penelitian berfokus pada pemberian uraian tentang konkretis...

An important issue in the use of expert sys­ tems is the so-called brittleness problem. Ex­ pert systems model only a limited part of the world. While the explicit management of uncertainty in expert systems mitigates the brittleness problem, it is still possible for a system to be used, unwittingly, in ways that the system is not prepared to address. Such a situation may be detected by the met...

Traditional scheduling methods such as CPM or PERT have been found to be inappropriate for scheduling the linear construction projects. According to the limitations of Traditional scheduling methods, Linear Scheduling Method (LSM) is proposed specifically for linear construction projects. Aiming at overcoming the limitations of network technology in deciding the production rate of linear constr...

This paper deals with the problem of ,nding a minimum cost schedule for a set of dependent activities when a convex cost function is attached to the starting time of each activity. A ,rst optimality necessary and su/cient condition bearing on the head and tail blocks of a schedule is ,rst established. A second such condition that uses the spanning active equality trees of a schedule leads to de...

From a set of a partially ordered tasks, one goal of the project scheduling problem is to compute earliest starting dates, latest starting dates and floats of the different tasks, and to identify critical tasks. When durations of tasks are not precisely known, the problem is much trickier. Recently we provided polynomial algorithms to compute upper bound of activity floats in the interval-value...

Este estudo exploratório visa entender quem se beneficia com programas de parcelamento e perdão dívidas tributárias. Para tanto, tem-se como objetivo pesquisa identificar diferenças econômico-financeiras entre empresas que aderiram não ao Programa Especial Regularização Tributária (PERT). Os resultados demonstram as firmas PERT possuem maiores volumes ativos são mais endividadas. Com base na te...

In this paper, we study the following theoretical scheduling problem: the tasks of a given application have to be statically distributed and executed on the heterogeneous servers of a multi-user system on a wide area, heterogeneous network, such as Internet. The application is divided into a set of communicating tasks that may be executed on at least one, and possibly several, servers. The proc...