Autor: Wikarek, J. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Application of different computational environments to optimization of makespan in the flow production line
Autorzy:: Sitek, P.
Wikarek, J.
Powiązania:: https://bibliotekanauki.pl/articles/118201.pdf
Data publikacji:: 2005
Wydawca:: Polskie Towarzystwo Promocji Wiedzy
Tematy:: CP
CLP
CCP
scheduling
Opis:: A mathematical model of makespan optimization in the divided flow production line is presented. The methodology of Constraint Programming and Integer Programming to optimization of makespan in the above environment have been considered. Multiple examples illustrate the concept proposed
Źródło:: Applied Computer Science; 2005, 1, 1; 220-239
1895-3735
Pojawia się w:: Applied Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Implementation of declarative framework for decision support system in scheduling problems
Autorzy:: Sitek, P.
Wikarek, J.
Powiązania:: https://bibliotekanauki.pl/articles/117767.pdf
Data publikacji:: 2007
Wydawca:: Polskie Towarzystwo Promocji Wiedzy
Tematy:: constraint programming
decision support
scheduling
Opis:: Scheduling problems appear frequently at different levels of decisions. They are usually characterized by many types of constraints, which make them unstructured and difficult to solve (NP-complete). Traditional mathematical programming approaches are deficient because their representation of constraints is artificial (using 0-1 variables). Unlike traditional approaches, constraint logic programming (CLP) provides for a natural representation of heterogeneous constraints. In CLP we state the problem requirements by constraints; we do not need to specify how to meet these requirements. In this paper we propose a declarative framework for decision support system (DSS) for constrained search problems implemented by CLP and relational SQL database. We illustrate this concept by the implementation of a DSS for scheduling problems with external resources in different production organization environments.
Źródło:: Applied Computer Science; 2007, 3, 2; 69-86
1895-3735
Pojawia się w:: Applied Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

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ł

Informacja