Skoči na glavni sadržaj

Journal of Information and Organizational Sciences, Vol. 21 No. 2, 1997.

Izvorni znanstveni članak

Optimal Scheduling Using Constraint Logic Programming

Jan Paralič orcid id orcid.org/0000-0002-4603-0411 ; Department of Cybernetics and Artificial Intelligence, Technical University of Kosice, Kosice, Slovak Republic
Julius Csonto ; Department of Cybernetics and Artificial Intelligence, Technical University of Kosice, Kosice, Slovak Republic
Milan Schmotzer ; Department of Cybernetics and Artificial Intelligence, Technical University of Kosice, Kosice, Slovak Republic

Puni tekst: engleski pdf 5.219 Kb

str. 1-9

preuzimanja: 1.310

citiraj

Sažetak

In this paper a methodology to solve scheduling applications (e.g. job-shop) using constraint logic programming (CLP) is presented. Firstly, the CLP problem definition is briefly described. Secondly, a new strategy for finding optimal solution is presented. New strategy consists of three steps. (1) A heuristic capable to find an initial solution of good quality very quickly (upper bound). (2) A heuristic to find a good lower for optimisation. (3) An effective strategy for finding the optimal solution within a minimal number of steps. The results achieved using this methodology on a set of randomly generated job-shop problems are presented.

Ključne riječi

constraint logic programming; optimisation; scheduling; job-shop

Hrčak ID:

79053

URI

https://hrcak.srce.hr/79053

Datum izdavanja:

12.12.1997.

Posjeta: 2.082 *