Abstract
The authors consider the problem of nonpreemptive scheduling of n tasks in a general job shop. The objective is to find a schedule of minimum length. The algorithm presented in the paper is based on the disjunctive graph approach. Its performance is not compared with other algorithms constructed for that problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have