Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

IP-Based Real-Time Dispatching for Two-Machine Batching Problem With Time Window Constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Myoungsoo Ham ; Syst. Eng., Samsung Austin Semicond., Austin, TX, USA ; Young Hoon Lee ; Jaehyung An

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.

Published in:

Automation Science and Engineering, IEEE Transactions on  (Volume:8 ,  Issue: 3 )