hrcak mascot   Srce   HID

Izvorni znanstveni članak

Optimal Scheduling Using Constraint Logic Programming

Jan Paralič   ORCID icon 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 MB) str. 1-9 preuzimanja: 501* citiraj
APA 6th Edition
Paralič, J., Csonto, J. i Schmotzer, M. (1997). Optimal Scheduling Using Constraint Logic Programming. Journal of Information and Organizational Sciences, 21 (2), 1-9. Preuzeto s https://hrcak.srce.hr/79053
MLA 8th Edition
Paralič, Jan, et al. "Optimal Scheduling Using Constraint Logic Programming." Journal of Information and Organizational Sciences, vol. 21, br. 2, 1997, str. 1-9. https://hrcak.srce.hr/79053. Citirano 21.08.2019.
Chicago 17th Edition
Paralič, Jan, Julius Csonto i Milan Schmotzer. "Optimal Scheduling Using Constraint Logic Programming." Journal of Information and Organizational Sciences 21, br. 2 (1997): 1-9. https://hrcak.srce.hr/79053
Harvard
Paralič, J., Csonto, J., i Schmotzer, M. (1997). 'Optimal Scheduling Using Constraint Logic Programming', Journal of Information and Organizational Sciences, 21(2), str. 1-9. Preuzeto s: https://hrcak.srce.hr/79053 (Datum pristupa: 21.08.2019.)
Vancouver
Paralič J, Csonto J, Schmotzer M. Optimal Scheduling Using Constraint Logic Programming. Journal of Information and Organizational Sciences [Internet]. 1997 [pristupljeno 21.08.2019.];21(2):1-9. Dostupno na: https://hrcak.srce.hr/79053
IEEE
J. Paralič, J. Csonto i M. Schmotzer, "Optimal Scheduling Using Constraint Logic Programming", Journal of Information and Organizational Sciences, vol.21, br. 2, str. 1-9, 1997. [Online]. Dostupno na: https://hrcak.srce.hr/79053. [Citirano: 21.08.2019.]

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

Posjeta: 585 *