Heuristic control of multiple batch processors with incompatible job families and future job arrivals
We analyse the problem of minimising the mean cycle time of a batch processing stage containing K > 1 batch processors in parallel with incompatible job families and future job arrivals. We provide an integer linear programming formulation and a dynamic program formulation for small problem insta...
Main Authors: | Tajan, John Benedict C., Sivakumar, Appa Iyer., Gershwin, Stanley B. |
---|---|
Other Authors: | School of Mechanical and Aerospace Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/104295 http://hdl.handle.net/10220/16994 |
Similar Items
-
Multi-agent path finding (part B)
by: Cao, Lifeng
Published: (2020) -
Interval job scheduling with machine launch cost
by: Ren, Runtian, et al.
Published: (2022) -
Weighted online sequential extreme learning machine for class imbalance learning
by: Lin, Zhiping, et al.
Published: (2013) -
Efficient cyclic routing of unmanned aerial vehicles
by: Ong, Chao Jian
Published: (2018) -
EasyPDP: an efficient parallel dynamic programming runtime system for computational biology
by: Tang, Shanjiang, et al.
Published: (2013)