<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://lib.psnc.pl/style/common/xsl/oai-style.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/
         http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
	<responseDate>2026-08-10T06:23:13Z</responseDate>
	<request identifier="oai:lib.psnc.pl:476" metadataPrefix="oai_dc" verb="GetRecord">
	https://lib.psnc.pl/oai-pmh-repository.xml</request>
	<GetRecord>
	
  <record>
	<header>
		<identifier>oai:lib.psnc.pl:476</identifier>
	    <datestamp>2014-07-29T09:42:18Z</datestamp>
		  <setSpec>PSNCRepository:PSNCExternalRepository:cmst:1996:vol2(1)1996</setSpec> 	      <setSpec>PSNCRepository:PSNCExternalRepository</setSpec> 	      <setSpec>PSNCRepository:PSNCExternalRepository:cmst</setSpec> 	      <setSpec>PSNCRepository:PSNCExternalRepository:cmst:1996</setSpec> 	      <setSpec>PSNCRepository</setSpec> 	    </header>
		<metadata>
	<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="pl"><![CDATA[A SIMULATED ANNEALING ALGORITHMFOR SOME CLASS OF DISCRETE-CONTINUOUSSCHEDULING PROBLEMS]]></dc:title>
<dc:creator xml:lang="pl"><![CDATA[Józefowska Joanna]]></dc:creator>
<dc:description xml:lang="pl"><![CDATA[Poznań]]></dc:description>
<dc:description xml:lang="pl"><![CDATA[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.]]></dc:description>
<dc:publisher xml:lang="pl"><![CDATA[OWN]]></dc:publisher>
<dc:contributor xml:lang="pl"><![CDATA[Mika Marek, Węglarz Jan]]></dc:contributor>
<dc:type xml:lang="pl"><![CDATA[artykuł]]></dc:type>
<dc:format xml:lang="pl"><![CDATA[application/pdf]]></dc:format>
<dc:identifier><![CDATA[https://lib.psnc.pl/dlibra/publication/edition/476/content]]></dc:identifier>
<dc:identifier><![CDATA[oai:lib.psnc.pl:476]]></dc:identifier>
<dc:identifier><![CDATA[http://lib.psnc.pl/Content/476/10.12921_cmst.1996.02.01.73-85_Jozefowska.pdf]]></dc:identifier>
<dc:language xml:lang="pl"><![CDATA[eng]]></dc:language>
<dc:relation><![CDATA[oai:lib.psnc.pl:publication:566]]></dc:relation>
</oai_dc:dc>

</metadata>
	  </record>	</GetRecord>
</OAI-PMH>
