<?xml version="1.0" encoding="utf-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2d1 20170631//EN" "JATS-journalpublishing1.dtd">
<ArticleSet>
  <Article>
    <Journal>
      <PublisherName>IJIRCSTJournal</PublisherName>
      <JournalTitle>International Journal of Innovative Research in Computer Science and Technology</JournalTitle>
      <PISSN>I</PISSN>
      <EISSN>S</EISSN>
      <Volume-Issue>Volume 3 Issue 3</Volume-Issue>
      <PartNumber/>
      <IssueTopic>Engineering</IssueTopic>
      <IssueLanguage>English</IssueLanguage>
      <Season>May - June 2015</Season>
      <SpecialIssue>N</SpecialIssue>
      <SupplementaryIssue>N</SupplementaryIssue>
      <IssueOA>Y</IssueOA>
      <PubDate>
        <Year>2019</Year>
        <Month>12</Month>
        <Day>02</Day>
      </PubDate>
      <ArticleType>Computer Sciences</ArticleType>
      <ArticleTitle>MINIMIZING RENTAL COST IN THREE-MACHINE FLOWSHOP PROBLEMS</ArticleTitle>
      <SubTitle/>
      <ArticleLanguage>English</ArticleLanguage>
      <ArticleOA>Y</ArticleOA>
      <FirstPage>139</FirstPage>
      <LastPage>142</LastPage>
      <AuthorList>
        <Author>
          <FirstName>LAXMI NARAIN</FirstName>          
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>Y</CorrespondingAuthor>
          <ORCID/>
             
        </Author>
      </AuthorList>
      <DOI></DOI>
      <Abstract>This paper studies three-machine specially structured flow-shop problems under rental Policy III. Here under Policy III, it is considered that first machine will be taken on rent in the starting of processing the jobs; second machine will be taken on rent when the first job is completed on first machine and third machine is taken on rent when first job is completed on second machine. The objective is to obtain a sequence which minimizes the total rental cost of the machines. An algorithm is developed using Branch-and-Bound technique. The algorithm is illustrated through a numerical example.</Abstract>
      <AbstractLanguage>English</AbstractLanguage>
      <Keywords>Flow-shop scheduling, Elapsed Time, Idle Time Rental Cost</Keywords>
      <URLs>
        <Abstract>https://ijircst.org/abstract.php?article_id=216</Abstract>
      </URLs>      
    </Journal>
  </Article>
</ArticleSet>