<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Isfahan University of Technology</PublisherName>
				<JournalTitle>Journal of Computational Methods in Engineering</JournalTitle>
				<Issn>2228-7698</Issn>
				<Volume>17</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>1998</Year>
					<Month>04</Month>
					<Day>15</Day>
				</PubDate>
			</Journal>
<ArticleTitle>The Problem of Scheduling Several Products on A Single Facility with the Simulated Annealing Technique</ArticleTitle>
<VernacularTitle>The Problem of Scheduling Several Products on A Single Facility with the Simulated Annealing Technique</VernacularTitle>
			<FirstPage>43</FirstPage>
			<LastPage>56</LastPage>
			<ELocationID EIdType="pii">2689</ELocationID>
			
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName></FirstName>
					<LastName>F. Mokhatab-Rafiei And M. Moattar Hosaini</LastName>
<Affiliation></Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>12</Month>
					<Day>31</Day>
				</PubDate>
			</History>
		<Abstract>This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique. This heuristic gives a sharper upper bound upper bound to holding and setup costs.</Abstract>
			<OtherAbstract Language="FA">This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique. This heuristic gives a sharper upper bound upper bound to holding and setup costs.</OtherAbstract>
<ArchiveCopySource DocType="pdf">https://jcme.iut.ac.ir/article_2689_577fd60255d4bb0f466464849ffe6d8e.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
