Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Banaszak, J." wg kryterium: Autor


Wyświetlanie 1-2 z 2
Tytuł:
Towards dedicated decision support tools: CLP-based approach
Autorzy:
Banaszak, Z.
Józefczyk, J.
Powiązania:
https://bibliotekanauki.pl/articles/118061.pdf
Data publikacji:
2005
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
decision support
constraint logic programming
production planning
modeling
scheduling
Opis:
Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in areas of integrated production planning. In that context, the CP can be considered as a well-suited framework for development of decision making software supporting small and medium size enterprises in the course of Production Process Planning (PPP). The problem considered regards of finding of computationally effective approach aimed at scheduling of a new project subject to constraints imposed by a multi–project environment. In other words, we are looking for an answer whether a given production order specified by its cost and completion time can be accepted in a given manufacturing system specified by available production capability, i.e., the time-constrained resources availability. The problem belongs to a class of multi-mode case project scheduling problems, where the problem of finding a feasible solution is NPcomplete. The aim of the paper is to present the CP modeling framework as well as to illustrate its application to decision making in the case of a new production order evaluation. So, the contribution emphasizes benefits derived from CPbased DSS and focuses on constraint satisfaction driven decision-making rather than on an optimal solution searching.
Źródło:
Applied Computer Science; 2005, 1, 1; 161-180
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Constraint-based scheduling in Oz/Mozart
Autorzy:
Sitek, P.
Wikarek, J.
Banaszak, Z.
Powiązania:
https://bibliotekanauki.pl/articles/118013.pdf
Data publikacji:
2006
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
constraint programming
decision support
scheduling
Opis:
In this paper we present how scheduling problems can be solved in the concurrent constraint programming (CCP) language Oz. Oz is the first high- level constraint language, which offers programmable search, modularity, expressiveness and an interface to invent new constraints using C++. As an example of scheduling problem the job-shop scheduling problem with manpower resources representation was considered. The objective discussed here is the minimization of the makespan. Allocating manpower to the jobs is more complicated than allocating machines, as different jobs and operations require different manpower. This problem is strongly NP-hard. We proposed the constraint programming (CP) based approach to decision support in this environment. The most important features of CP are declarative problem modeling, allowing a clear separation between the problem statement (variables and constraints) and the resolution of the problem.
Źródło:
Applied Computer Science; 2006, 2, 1; 83-99
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies