<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Luders_et_al_2009a</id>
		<title>Luders et al 2009a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Luders_et_al_2009a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Luders_et_al_2009a&amp;action=history"/>
		<updated>2026-04-21T16:57:38Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Luders_et_al_2009a&amp;diff=213662&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 506929020 to Luders et al 2009a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Luders_et_al_2009a&amp;diff=213662&amp;oldid=prev"/>
				<updated>2021-02-15T09:10:04Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_506929020&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 506929020&quot;&gt;Draft Content 506929020&lt;/a&gt; to &lt;a href=&quot;/public/Luders_et_al_2009a&quot; title=&quot;Luders et al 2009a&quot;&gt;Luders et al 2009a&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 09:10, 15 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>https://www.scipedia.com/wd/index.php?title=Luders_et_al_2009a&amp;diff=213661&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Na programação de operações de movimentação de petróleo em complexos portuários contendo navios, píeres, tanques e oleodutos, um modelo de otimizaç...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Luders_et_al_2009a&amp;diff=213661&amp;oldid=prev"/>
				<updated>2021-02-15T09:10:01Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Na programação de operações de movimentação de petróleo em complexos portuários contendo navios, píeres, tanques e oleodutos, um modelo de otimizaç...&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;
Na programação de operações de movimentação de petróleo em complexos portuários contendo navios, píeres, tanques e oleodutos, um modelo de otimização das operações é frequentemente utilizado. Entretanto, devido à complexidade do problema, o tempo computacional é um fator limitante. Neste artigo, estuda-se a aplicação de um modelo de programação linear inteira mista (PLIM) existente na literatura e propõe-se uma etapa de pré-processamento, baseada na teoria das restrições (TOC), com o objetivo de reduzir o tempo computacional. A partir da identificação do gargalo do problema, determinadas restrições são retiradas do modelo numa etapa de pré-processamento. Para verificar a escolha das restrições críticas no pré-processamento, uma análise baseada na noção de preço dual do LP é apresentada. Embora a otimalidade da solução não seja garantida, os resultados mostram uma pequena deterioração da solução em relação à ótima. Porém, com o tempo computacional significativamente reduzido.&amp;lt;br&amp;gt;In the scheduling of oil transfer operations for harbor plants containing ships, piers, tanks and pipelines, an optimization model is frequently used. However, due to the complexity involved, computational time is a real concern. In this paper, a mixed integer linear programming model (MILP) found in the literature is studied and a preprocessing procedure is proposed. This procedure is based on the Theory of Constraints (TOC), which is used to reduce the model compilation time. Since the problem bottleneck is identified, the corresponding constraints are not considered in the preprocessing step. An analysis based on LP dual price is also carried out to verify actions taken in the preprocessing step. Although optimality cannot be assured, the results obtained show a minor deviation from the optimal solution but with a significant computational time gain.&lt;br /&gt;
&lt;br /&gt;
Document type: Article&lt;br /&gt;
&lt;br /&gt;
== Full document ==&lt;br /&gt;
&amp;lt;pdf&amp;gt;Media:Draft_Content_506929020-beopen673-4210-document.pdf&amp;lt;/pdf&amp;gt;&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://www.scielo.br/pdf/pope/v29n1/a01v29n1.pdf http://www.scielo.br/pdf/pope/v29n1/a01v29n1.pdf] under the license https://creativecommons.org/licenses/by-nc&lt;br /&gt;
&lt;br /&gt;
* [http://www.scielo.br/scielo.php?script=sci_arttext&amp;amp;pid=S0101-74382009000100001 http://www.scielo.br/scielo.php?script=sci_arttext&amp;amp;pid=S0101-74382009000100001] under the license cc-by-nc&lt;br /&gt;
&lt;br /&gt;
* [http://www.scielo.br/scielo.php?script=sci_arttext&amp;amp;pid=S0101-74382009000100001&amp;amp;lng=en&amp;amp;tlng=en http://www.scielo.br/scielo.php?script=sci_arttext&amp;amp;pid=S0101-74382009000100001&amp;amp;lng=en&amp;amp;tlng=en]&lt;br /&gt;
&lt;br /&gt;
* [http://www.scielo.br/pdf/pope/v29n1/a01v29n1.pdf http://www.scielo.br/pdf/pope/v29n1/a01v29n1.pdf],&lt;br /&gt;
: [http://dx.doi.org/10.1590/s0101-74382009000100001 http://dx.doi.org/10.1590/s0101-74382009000100001] under the license http://creativecommons.org/licenses/by-nc/4.0/&lt;br /&gt;
&lt;br /&gt;
* [http://www.scielo.br/scielo.php?script=sci_arttext&amp;amp;pid=S0101-74382009000100001 http://www.scielo.br/scielo.php?script=sci_arttext&amp;amp;pid=S0101-74382009000100001],&lt;br /&gt;
: [https://doaj.org/toc/0101-7438 https://doaj.org/toc/0101-7438],&lt;br /&gt;
: [https://doaj.org/toc/1678-5142 https://doaj.org/toc/1678-5142]&lt;br /&gt;
&lt;br /&gt;
* [https://www.scielo.br/pdf/pope/v29n1/a01v29n1.pdf https://www.scielo.br/pdf/pope/v29n1/a01v29n1.pdf],&lt;br /&gt;
: [https://www.scielo.br/scielo.php?script=sci_arttext&amp;amp;pid=S0101-74382009000100001 https://www.scielo.br/scielo.php?script=sci_arttext&amp;amp;pid=S0101-74382009000100001],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2083511626 https://academic.microsoft.com/#/detail/2083511626]&lt;br /&gt;
&lt;br /&gt;
* [ ]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>