<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>international journal of industrial Engineering &amp; Production Research</title>
<title_fa>نشریه بین المللی مهندسی صنایع و تحقیقات تولید</title_fa>
<short_title>IJIEPR</short_title>
<subject>Engineering &amp; Technology</subject>
<web_url>http://ijiepr.iust.ac.ir</web_url>
<journal_hbi_system_id>18</journal_hbi_system_id>
<journal_hbi_system_user>agent2</journal_hbi_system_user>
<journal_id_issn>2008-4889</journal_id_issn>
<journal_id_issn_online>2345-363X</journal_id_issn_online>
<journal_id_pii></journal_id_pii>
<journal_id_doi></journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid></journal_id_sid>
<journal_id_nlai></journal_id_nlai>
<journal_id_science></journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1405</year>
	<month>6</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2026</year>
	<month>9</month>
	<day>1</day>
</pubdate>
<volume>37</volume>
<number>3</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>en</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>A Mixed-Integer Programming and Genetic Algorithm Approach for a Two-Stage Hybrid Flow Shop with Shared Machines in Cardboard Cutting Operations</title>
	<subject_fa>Optimization Techniques</subject_fa>
	<subject>Optimization Techniques</subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research</content_type>
	<abstract_fa></abstract_fa>
	<abstract>&lt;div style=&quot;text-align: justify;&quot;&gt;&lt;em&gt;&lt;span style=&quot;font-size:12.0pt&quot;&gt;&lt;span style=&quot;font-family:&amp;quot;Times New Roman&amp;quot;,serif&quot;&gt;This paper addresses pattern scheduling within cutting stock problems, treating it as a specialized instance of a two-stage hybrid flow shop (HFS) problem with unrelated parallel machines at each stage. Originating from a real industrial case in the corrugated cardboard-cutting industry (UNIPACK), the problem incorporates machine eligibility restrictions, shared bi-functional machines across stages, and a novel positional constraint that prevents job splitting on shared machines. To address these complexities, we propose a mixed-integer programming (MIP) model that minimizes production costs comprising weighted job flow-time costs and makespan-related labor costs. We complement this with a genetic algorithm (GA) metaheuristic for larger instances. The MIP achieves optimality for instances with up to 20 jobs; for instances with 22&amp;ndash;32 jobs, it returns the best feasible solution found within a 225-second time limit. For all instances where an MIP reference exists (up to 32 jobs), the GA solutions deviate from the MIP reference by an average of 5.2%. For larger instances (up to 200 jobs), the GA produces near-optimal solutions in under 120 seconds, demonstrating strong scalability. Computational experiments on 16 benchmark instances confirm the effectiveness of both approaches and highlight their complementary strengths. &lt;/span&gt;&lt;/span&gt;&lt;/em&gt;&lt;/div&gt;</abstract>
	<keyword_fa></keyword_fa>
	<keyword>Cutting stock, scheduling, hybrid flow shop, eligible machine, shared machine, positional constraint, setup time, mixed-integer programming, genetic algorithm.</keyword>
	<start_page>121</start_page>
	<end_page>133</end_page>
	<web_url>http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-3524-1&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Oumaima</first_name>
	<middle_name></middle_name>
	<last_name>Ben REBAH</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>imaoumaima@gmail.com</email>
	<code>1800319475328460015353</code>
	<orcid>1800319475328460015353</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>Department of ManagementGraduate School of Commerce of Sfax, University of Sfax.Sfax, Tunisia.</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>Abdelkarim</first_name>
	<middle_name></middle_name>
	<last_name>Elloumi</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>abdelkarim.elloumi@fsegs.usf.tn</email>
	<code>1800319475328460015354</code>
	<orcid>1800319475328460015354</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Department of Quantitative MethodsFaculty of Economics and Management, University of Sfax.Sfax, Tunisia.</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>Racem</first_name>
	<middle_name></middle_name>
	<last_name>Mellouli</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>racem.mellouli@fsegs.usf.tn</email>
	<code>1800319475328460015355</code>
	<orcid>1800319475328460015355</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Department of Quantitative MethodsFaculty of Economics and Management, University of Sfax.Sfax, Tunisia.</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


	</article>
</articleset>
</journal>
