Referenced Items are not available for this document.
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
)
Date of Publication: July 2011
- Page(s):
- 589 - 597
- ISSN :
- 1545-5955
- INSPEC Accession Number:
- 12141601
- Digital Object Identifier :
- 10.1109/TASE.2010.2098867
- Product Type:
- Journals & Magazines
- Date of Publication :
- 17 January 2011
- Date of Current Version :
- 04 July 2011
- Issue Date :
- July 2011
- Sponsored by :
- IEEE Robotics and Automation Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
