Ignall and Schrage developed branch and bound algorithm to minimize the makespan for scheduling problem. (a) Single
Question:
Ignall and Schrage developed branch and bound algorithm to minimize the makespan for scheduling problem.
(a) Single machine
(b) Flow shop
(c) Job shop
(d) None of the above AppendixLO1
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Answered By
AJIN KURIAKOSE
I HAVE ELECTRONICS ENGINEERING DEGREE..AND MY AREA OF INTEREST IS MATHEMATICS,CONTROL SYSTEM,NETWORK,DIGITAL
21+ Reviews
32+ Question Solved
Related Book For 
Question Posted:
