<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Mostafaei_et_al_2018a</id>
		<title>Mostafaei et al 2018a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Mostafaei_et_al_2018a"/>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Mostafaei_et_al_2018a&amp;action=history"/>
		<updated>2026-06-13T18:12:24Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>http://www.colloquiam.com/wd/index.php?title=Mostafaei_et_al_2018a&amp;diff=209513&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 408245395 to Mostafaei et al 2018a</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Mostafaei_et_al_2018a&amp;diff=209513&amp;oldid=prev"/>
				<updated>2021-02-08T08:42:31Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_408245395&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 408245395&quot;&gt;Draft Content 408245395&lt;/a&gt; to &lt;a href=&quot;/public/Mostafaei_et_al_2018a&quot; title=&quot;Mostafaei et al 2018a&quot;&gt;Mostafaei et al 2018a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 08:42, 8 February 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>http://www.colloquiam.com/wd/index.php?title=Mostafaei_et_al_2018a&amp;diff=209512&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Scheduling multiproduct pipelines is a complex managerial task with a remarkable impact on the total revenues of the pipeline industry. It consists of sequenc...&quot;</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Mostafaei_et_al_2018a&amp;diff=209512&amp;oldid=prev"/>
				<updated>2021-02-08T08:42:28Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Scheduling multiproduct pipelines is a complex managerial task with a remarkable impact on the total revenues of the pipeline industry. It consists of sequenc...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
Scheduling multiproduct pipelines is a complex managerial task with a remarkable impact on the total revenues of the pipeline industry. It consists of sequencing, sizing and timing of injections and removals, to meet product demands on time at minimum cost. Generating the detailed scheduling of pipeline networks can be very challenging, requiring efficient optimization tools to find good feasible solutions. This paper develops a hierarchical decomposition approach for tree-like pipeline systems with two-level branching. Decisions related to the sequence of product injections and the destination for each batch, are made at the higher planning layer, while the lower layer then finds the sequence and timing of product deliveries. Each layer is tackled by a mixed-integer linear programming (MILP) formulation, which neither discretizes the time horizon nor divides a pipeline segment into packs of equal size. Solutions to three case studies present significant reductions in both the operating cost and the computational burden.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [http://juuli.fi/Record/0333738018 http://juuli.fi/Record/0333738018],&lt;br /&gt;
: [http://dx.doi.org/10.1007/9783319947679_13 http://dx.doi.org/10.1007/9783319947679_13]&lt;br /&gt;
&lt;br /&gt;
* [http://link.springer.com/content/pdf/10.1007/978-3-319-94767-9_13 http://link.springer.com/content/pdf/10.1007/978-3-319-94767-9_13],&lt;br /&gt;
: [http://dx.doi.org/10.1007/978-3-319-94767-9_13 http://dx.doi.org/10.1007/978-3-319-94767-9_13] under the license http://www.springer.com/tdm&lt;br /&gt;
&lt;br /&gt;
* [https://link.springer.com/chapter/10.1007/978-3-319-94767-9_13 https://link.springer.com/chapter/10.1007/978-3-319-94767-9_13],&lt;br /&gt;
: [https://rd.springer.com/chapter/10.1007/978-3-319-94767-9_13 https://rd.springer.com/chapter/10.1007/978-3-319-94767-9_13],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2810761851 https://academic.microsoft.com/#/detail/2810761851]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
DOIS: 10.1007/9783319947679_13 10.1007/978-3-319-94767-9_13&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>