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ę "CP" wg kryterium: Wszystkie pola


Wyświetlanie 1-4 z 4
Tytuł:
CP-based decision support for scheduling
Autorzy:
Relich, M.
Powiązania:
https://bibliotekanauki.pl/articles/118311.pdf
Data publikacji:
2011
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
project management
constraint programming
alternative projects
Opis:
The paper presents the declarative approach to design of a reference model aimed at project prototyping. The reference model contains the finite set of decision variables, their domains and linking those constraints, i.e. can be seen as a kind of Constraint Satisfaction Problem. Consequently, the model considered can be treated as a knowledge base specifying both a class of enterprises and the projects that could be conducted on their base. So, the model provides a platform for rapid prototyping of alternative versions of project scheduling. The routine queries can be formulated in the straight or reverse way. In that context, the proposed reference model can be implemented in constraint programming (CP) techniques
Źródło:
Applied Computer Science; 2011, 7, 1; 7-17
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł
Tytuł:
CP approach to design of steady-state flow of repetitive manufacturing processes in SME
Autorzy:
Wójcik, R.
Bocewicz, G.
Powiązania:
https://bibliotekanauki.pl/articles/118159.pdf
Data publikacji:
2005
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
production planning
waiting-free schedules design
constraint logic programming
Opis:
Concurrent execution of work orders in the small and medium size enterprises (SME) imposes a necessity to consider many control problems concerning systems of repetitive concurrent manufacturing processes using common resources in mutual exclusion. In many cases a production system with a given structure of the processes resource requests can be seen as composed of subsystems with n cyclic processes sharing one resource. For given sets of possible values of the processes operation execution times a problem of finding schedules guaranteeing that no process waits for access to the common resources is considered. In particular for the assigned times of the operations execution a subproblem of finding all possible starting times of work orders execution for which waiting-free schedules exist has been formulated as a constraint programming (CP) problem. The starting times derived can be used as an alternative starting times of work orders execution in case of their possible delays. A state space of the problem’s solutions has been reduced using constraints based on the necessary and sufficient conditions for existence of a waiting-free n-process steady-state schedule. An illustrative example of Mozart-based software application to the solution of constraint logic programming problem considered has been presented.
Źródło:
Applied Computer Science; 2005, 1, 1; 201-218
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
CP-based decision support package for production flow planning - an SME perspective
Autorzy:
Bzdyra, K.
Tomczuk-Piróg, I.
Powiązania:
https://bibliotekanauki.pl/articles/1395582.pdf
Data publikacji:
2006
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
constraint logic programming
decision support
flow planning
constraint satisfaction problem (CSP)
Opis:
Solving complex, decision-making problems requires application of decision support systems. The best solving strategy can be defined for each particular problem. The strategy refers to a sequence solving elementary subproblems. The aim of the paper is to present the evaluating criterion to estimate the efficiency of searching strategies. The criterion proposed offers a possibility to estimate the time needed to solve a constraint satisfaction problem. An illustrative example is provided.
Źródło:
Applied Computer Science; 2006, 2, 1; 100-109
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    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