Search Results for "scheduling"

...Traditional pipeline parallelism methods (e.g. 1F1B or staggered pipelining) leave gaps because forward and backward phases can’t fully overlap with communication. DualPipe addresses that by scheduling micro-batches from both ends of the pipeline in a bidirectional fashion—i.e. some micro-batches flow forward while others flow backward—so that computation on one partition can coincide with communication for another.

The React Fiber Architecture project is a detailed technical document that explains the internal design and behavior of React Fiber, the core algorithm that powers modern React rendering. Rather than being a traditional code library, it serves as an educational deep dive into how React manages updates, scheduling, and reconciliation under the hood. The document explores how Fiber replaces the older stack-based reconciliation algorithm with a more flexible system that breaks rendering work into incremental units. This enables advanced features such as interruptible rendering, prioritization of updates, and smoother user interfaces during complex operations. ...

Flexible job shop scheduling problem (FJSP) is very important in many fields such as production management, resource allocation and combinatorial optimization. In the real manufacturing systems, each operation could be processed on more than one machine and each machine can also process several operations. This feature is known as flexibility. You can define your problem in this software and get an optimal solution as a Gantt Chart.

Asteroid has been merged with Scampi, to give rise to OScar. Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms.

TimeFinder automatically optimizes schedules (timetables) for universities and high schools. It makes manual timetabling for the timetabler easier via a Java GUI. Export+import is supported via xml and text formats. http://timefinder.sourceforge.net/

This project is using genetics algorithms to complete scheduling tasks such as timetables for elementary / high schools etc. Currently NetBeans project with no GUI and simple HTML export.

Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.

Taseree has been renamed to Drools Planner and moved to JBoss.org, see http://www.jboss.org/drools/drools-planner

LogiDist offer a solution of "Computer Aided Logistic" with mostly informative purposes on executed pickups/delivery of merchandise. Is able to manage the whole process of purchase, order management, merchandise delivery to reduce distribution costs.

Mr. Logister is a resource scheduling application that uses genetic algorithms to find the best utilization and allocation of resources. The scheduler understands hard constraints like free/busy time and soft constraints like suitability and preferences.