Nie masz uprawnień do wyświetlenia tego obiektu. Aby poprosić o dostęp do niego, wypełnij poniższe pola.
Józefowska Joanna
artykuł
Mika Marek, Węglarz Jan
In this paper a Simulated Annealing algorithm is proposed and applied to the n-job andm-machme discrete-continuous scheduling problem with the objective to minimize the makespan.This problem can be divided into two interrelated subproblems (i) constructing a feasible sequenceof jobs on machines and (ii) allocating the continuos resource among jobs already sequenced.The application of the Simulated Annealing algorithm operating on a space of feasible sequences ispresented. By computational experiment on randomly generated test problems, the proposedalgorithm is compared with two other heuristics, namely Multi-start Iterative Improvementalgorithm and Random Sampling Technique.
Poznań
OWN
application/pdf
oai:lib.psnc.pl:476
eng
2014-07-29
2014-05-21
133
https://lib.psnc.pl/publication/566
RDF
OAI-PMH
Józefowska Joanna Mika Marek, Różycki Rafał, Waligóra Grzegorz, Węglarz Jan
Ta strona wykorzystuje pliki 'cookies'. Więcej informacji Rozumiem