Job shop scheduling or the job-shop problem is an optimization problem in computer science and operations research in which ideal jobs are assigned to resources at particular times. The most basic version is as follows: We are given n jobs J1, J2,..., Jn of varying processing times, which need to be scheduled on m machines with varying processing power, while trying to minimize the makespan. The makespan is the total length of the schedule. In most practical settings, the problem is presented as an online problem, that is, the decision of scheduling a job can only be made online, when the job is presented to the algorithm.

Want to Learn

Top 3 Tutorials For Scheduler