<?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=Klabjan_et_al_2008a</id>
		<title>Klabjan et al 2008a - 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=Klabjan_et_al_2008a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Klabjan_et_al_2008a&amp;action=history"/>
		<updated>2026-04-23T14:02:01Z</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=Klabjan_et_al_2008a&amp;diff=211176&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 272537311 to Klabjan et al 2008a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Klabjan_et_al_2008a&amp;diff=211176&amp;oldid=prev"/>
				<updated>2021-02-12T11:42:13Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_272537311&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 272537311&quot;&gt;Draft Content 272537311&lt;/a&gt; to &lt;a href=&quot;/public/Klabjan_et_al_2008a&quot; title=&quot;Klabjan et al 2008a&quot;&gt;Klabjan et al 2008a&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 11:42, 12 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=Klabjan_et_al_2008a&amp;diff=211175&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Crane sequencing in container terminals determines the order of ship discharging and loading jobs that quay cranes (QCs) perform, so that the duration of a ve...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Klabjan_et_al_2008a&amp;diff=211175&amp;oldid=prev"/>
				<updated>2021-02-12T11:42:09Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Crane sequencing in container terminals determines the order of ship discharging and loading jobs that quay cranes (QCs) perform, so that the duration of a ve...&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;
Crane sequencing in container terminals determines the order of ship discharging and loading jobs that quay cranes (QCs) perform, so that the duration of a vessel's stay is minimized. The ship's load profile, berthing time, number of available bays, and QCs are considered. More important, clearance and yard congestion constraints need to be included, which, respectively, ensure that a minimum distance between adjacent QCs is observed and yard storage blocks are not overly accessed at any point in time. In sequencing for a single ship, a mixed-integer programming (MIP) model is proposed, and a heuristic approach based on the model is developed that produces good solutions. The model is then reformulated as a generalized set covering problem and solved exactly by branch and price (B&amp;amp;P). For multiship sequencing, the yard congestion constraints are relaxed in the spirit of Lagrangian relaxation, so that the problem decomposes by vessel into smaller subproblems solved by B&amp;amp;P. An efficient primal heuristic is also designed. Computational experiments reveal that large-scale problems can be solved in a reasonable computational time.&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_272537311-beopen44-1158-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;
* [https://dspace.mit.edu/bitstream/1721.1/77966/1/Simchi-Levi_Multiship%20crane.pdf https://dspace.mit.edu/bitstream/1721.1/77966/1/Simchi-Levi_Multiship%20crane.pdf] under the license https://creativecommons.org/licenses/by-nc-sa&lt;br /&gt;
&lt;br /&gt;
* [http://hdl.handle.net/1721.1/77966 http://hdl.handle.net/1721.1/77966],&lt;br /&gt;
: [https://orcid.org/0000-0002-4650-1519 https://orcid.org/0000-0002-4650-1519] under the license cc-by-nc-sa&lt;br /&gt;
&lt;br /&gt;
* [https://pubsonline.informs.org/doi/10.1287/trsc.1090.0296 https://pubsonline.informs.org/doi/10.1287/trsc.1090.0296],&lt;br /&gt;
: [https://dspace.mit.edu/openaccess-disseminate/1721.1/77966 https://dspace.mit.edu/openaccess-disseminate/1721.1/77966],&lt;br /&gt;
: [https://trid.trb.org/view/919004 https://trid.trb.org/view/919004],&lt;br /&gt;
: [https://www.scholars.northwestern.edu/en/publications/multiship-crane-sequencing-with-yard-congestion-constraints https://www.scholars.northwestern.edu/en/publications/multiship-crane-sequencing-with-yard-congestion-constraints],&lt;br /&gt;
: [https://dblp.uni-trier.de/db/journals/transci/transci44.html#ChooKS10 https://dblp.uni-trier.de/db/journals/transci/transci44.html#ChooKS10],&lt;br /&gt;
: [https://dl.acm.org/citation.cfm?id=1735111 https://dl.acm.org/citation.cfm?id=1735111],&lt;br /&gt;
: [https://doi.org/10.1287/trsc.1090.0296 https://doi.org/10.1287/trsc.1090.0296],&lt;br /&gt;
: [https://ideas.repec.org/a/inm/ortrsc/v44y2010i1p98-115.html https://ideas.repec.org/a/inm/ortrsc/v44y2010i1p98-115.html],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2156232844 https://academic.microsoft.com/#/detail/2156232844] under the license http://creativecommons.org/licenses/by-nc-sa/3.0/&lt;br /&gt;
&lt;br /&gt;
* [https://pubsonline.informs.org/doi/pdf/10.1287/trsc.1090.0296 https://pubsonline.informs.org/doi/pdf/10.1287/trsc.1090.0296],&lt;br /&gt;
: [http://dx.doi.org/10.1287/trsc.1090.0296 http://dx.doi.org/10.1287/trsc.1090.0296]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>