Module librualg::sheduling

Sheduling algorithms

Structs

Job

Functions

johnson_algorithm

Johnson’s Algorithm For Scheduling There are n parts and two machines. Each part must first be machined on the first machine, then on the second one. The i-th part is machined on the first machine in a_i time, and on the second machine in b_i time. Each machine can handle only one part at any given time. You need to create an order of feeding parts to the machines, so that the total machining time of all parts would be minimal. return (order_jobs, total time)