Our algorithm presents a novel conflict resolution method that reduces disassembly to weighted interval scheduling. Additionally, we present a weight assignment algorithm that allows us to learn ...

The interval scheduling maximization (ISM) problem is to find a largest compatible set - a set of non-overlapping intervals of maximum size. The goal here is to execute as many tasks as possible.

It uses a segment tree to quickly detect schedule conflicts and a greedy interval scheduling algorithm to suggest non-overlapping events. For personalized planning, a 0/1 Knapsack algorithm recommends ...

For the scheduling problem of Semiconductor wafer fabrication (SWF), a new Dispatching rule based on the load balance (DRLB) is proposed. Further, a new Harmony search (HS) algorithm based receipt ...