<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Package | Scheduling-cc</title><link>https://scheduling.cc/tag/package/</link><atom:link href="https://scheduling.cc/tag/package/index.xml" rel="self" type="application/rss+xml"/><description>Package</description><generator>Wowchemy (https://wowchemy.com)</generator><language>en-us</language><lastBuildDate>Thu, 29 Sep 2022 10:39:58 +0000</lastBuildDate><image><url>https://scheduling.cc/media/icon_hu50f9a2184eb6d4cb51dd961303bcdd64_9406_512x512_fill_lanczos_center_3.png</url><title>Package</title><link>https://scheduling.cc/tag/package/</link></image><item><title>Pyscheduling</title><link>https://scheduling.cc/project/pyscheduling/</link><pubDate>Thu, 29 Sep 2022 10:39:58 +0000</pubDate><guid>https://scheduling.cc/project/pyscheduling/</guid><description>&lt;p>
&lt;figure >
&lt;div class="d-flex justify-content-center">
&lt;div class="w-100" >&lt;img alt="" srcset="
/project/pyscheduling/pyscheduling_cc-03_hu67ef9ff101016214912926b6ef27eccd_45047_9b9b128ecca6d66265614cba139523d1.webp 400w,
/project/pyscheduling/pyscheduling_cc-03_hu67ef9ff101016214912926b6ef27eccd_45047_b52cd2d98a7925bbfa4996bd03b380fa.webp 760w,
/project/pyscheduling/pyscheduling_cc-03_hu67ef9ff101016214912926b6ef27eccd_45047_1200x1200_fit_q75_h2_lanczos_3.webp 1200w"
src="https://scheduling.cc/project/pyscheduling/pyscheduling_cc-03_hu67ef9ff101016214912926b6ef27eccd_45047_9b9b128ecca6d66265614cba139523d1.webp"
width="760"
height="381"
loading="lazy" data-zoomable />&lt;/div>
&lt;/div>&lt;/figure>
&lt;/p>
&lt;p>P﻿yscheduling is an open-source python package to solve &lt;strong>scheduling&lt;/strong> problems. The categories tackled are : Single Machine, Parallel Machines, Flowshop and Jobshop.&lt;/p>
&lt;p>The infrastructure for each category is implemented and open to extension to accept problems with more specificity in terms of constraints and multi-objective opptimization. There are methods going from exact methods, heuristics, metaheuristics, B&amp;amp;B, &amp;hellip;etc to solve the different problems of the given category.&lt;/p>
&lt;p>S﻿ingle Machine Scheduling Problems :&lt;/p>
&lt;ul>
&lt;li>M﻿inimize Total Weighted Lateness.&lt;/li>
&lt;li>M﻿inimize Total Weighted Lateness with release dates.&lt;/li>
&lt;li>M﻿inimize Total Weighted Lateness with sequence dependent setup time.&lt;/li>
&lt;li>M﻿inimize Total Weighted Lateness with release dates and sequence dependent setup time.&lt;/li>
&lt;li>M﻿inimize Maximal Lateness with release dates and precedence constraints.&lt;/li>
&lt;li>M﻿inimize Total Weighted Completion Time.&lt;/li>
&lt;li>M﻿inimize Total Weighted Completion Time with release dates.&lt;/li>
&lt;li>M﻿inimize Maximal Completion Time with sequence dependent setup time.&lt;/li>
&lt;li>M﻿inimize Maximal Completion Time with release dates and sequence dependent setup time.&lt;/li>
&lt;/ul>
&lt;p>P﻿arallel Machine Scheduling Problems :&lt;/p>
&lt;ul>
&lt;li>M﻿inimize Maximal Completion Time with sequence dependent setup time.&lt;/li>
&lt;li>M﻿inimize Maximal Completion Time with release dates and sequence dependent setup time.&lt;/li>
&lt;/ul>
&lt;p>F﻿lowshop :&lt;/p>
&lt;ul>
&lt;li>M﻿inimize Maximal Completion Time.&lt;/li>
&lt;li>M﻿inimize Maximal Completion Time with sequence dependent setup time.&lt;/li>
&lt;/ul>
&lt;p>J﻿obshop :&lt;/p>
&lt;ul>
&lt;li>M﻿inimize Maximal Completion Time.&lt;/li>
&lt;/ul>
&lt;p>A﻿n easy-to-use interface is available for both single and parallel machines problems sheduling. In addition to both interfaces, a &lt;strong>benchmark&lt;/strong> module is also available to allow it for users and especially researchers to test and benchmark their implemented methods based on our infrastructure with a given instances benchmark set.&lt;/p>
&lt;p>T﻿he package is open to contribute for anyone in order to enrich the categories infrastructure, to implement state-of-the-art methods and to tackle more constrained problems.&lt;/p>
&lt;p>T﻿his work couldn&amp;rsquo;t have been without the participation of the awesome colleagues:&lt;/p>
&lt;ul>
&lt;li>Y﻿ounes Mimene&lt;/li>
&lt;li>K﻿arima Benatchba&lt;/li>
&lt;li>F﻿arouk Yalaoui&lt;/li>
&lt;/ul></description></item></channel></rss>