Title
IP-Based Real-Time Dispatching for Two-Machine Batching Problem With Time Window Constraints
Abstract
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.
Year
DOI
Venue
2011
10.1109/TASE.2010.2098867
IEEE T. Automation Science and Engineering
Keywords
Field
DocType
Real time systems,Dispatching,Computational modeling,Job shop scheduling,Manufacturing,Time factors,Optimal scheduling
Mathematical optimization,Heuristic,Job shop scheduling,Scheduling (computing),Computer science,Flow shop scheduling,Real-time computing,Scheduling (production processes),Integer programming,Job scheduler,Batch processing
Journal
Volume
Issue
ISSN
8
3
1545-5955
Citations 
PageRank 
References 
1
0.36
11
Authors
3
Name
Order
Citations
PageRank
Myoungsoo Ham130.79
Young Hoon Lee216220.00
Jaehyung An310.36