Skip to Main Content
A binary integer programming based real-time dispatching heuristic (i-RTD) approach to minimize the makespan of the two-machine batching flow-shop problem with time window constraints is presented for the first time. By scheduling only necessary batches at each iteration, i -RTD works with considerably fewer binary variables so that it runs in real-time. The experimental study demonstrates the proposed i-RTD can generate the efficient solution in real-time, which implies we can implement the proposed approach into real industry where a quick and efficient schedule is required.
Automation Science and Engineering, IEEE Transactions on (Volume:8 , Issue: 3 )
Date of Publication: July 2011