On-chip resource sharing among sibling cores causes resource contention on Chip Multiprocessors (CMP), considerably degrading program performance and system fairness. Job co-scheduling attempts to alleviate the problem by assigning jobs to cores intelligently. Despite many heuristics-based empirical explorations, studies on optimal co-scheduling and its inherent complexity start only recently, ...

In machine scheduling, a set of n jobs must be scheduled on a set of m machines. Each job i incurs a processing time of pij on machine j and the goal is to schedule jobs so as to minimize some global objective function, such as the maximum makespan of the schedule considered in this paper. Often in practice, each job is controlled by an independent selfish agent who chooses to schedule his job ...

In this paper, we consider two customized parallel machines scheduling problem with precedence relations to minimize makespan. Complexity and approximation results are presented.

PT. XYZ is a company engaged in the field of Automotive Parts Manufacturer. In carrying out its production this uses make to order. The carries simple planning and scheduling, namely FCFS (First Come First Serve). has problem, there no scheduling with appropriate machine assignment. This causes sometimes experience delays completing product. purpose study overcome problems companies minimize or...

We introduce the multi-agent transportation (MAT) problem, where agents have to transport containers from their starting positions designated goal positions. Movement takes place in a common environment collisions between and must be avoided. In contrast other frameworks such as pathfinding (MAPF) or pickup delivery (MAPD), are allowed separate at any time, which can reduce makespan also allows...