- 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ł