Affiliation:
1. Silesian University of Technology
Abstract
The paper presents a solution useful for production scheduling in the context of the constraints arising from the complexity of the structures of realized processes and possibilities of use variants of their implementation. The proposed method uses both activity on arc and activity on node types of graph for describing multivariant processes. Representation of complex (composed) structures the AND-OR graphs are used that combines both conjunction and disjunction relations between nodes.
Publisher
Trans Tech Publications, Ltd.
Reference16 articles.
1. Z. Xie, S. Hao, G. Ye, G. Tan, A new algorithm for complex product flexible scheduling with constraint between jobs. Computers & Industrial Engineering, vol. 57 (2009), pp.766-772.
2. P. Pongcharoen, C. Hicks, P.M. Braiden, D.J. Stewardson, Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products. International Journal of Production Economics, vol. 78 (2002), pp.311-322.
3. K. Kalinowski, Decision making stages in production scheduling of complex products, Journal of Machine Engineering, vol. 11, no. 1-2, (2011), pp.68-77.
4. W. Imrich, S. Klavzar, D.F. Rall, Topics in Graph Theory: Graphs and Their Cartesian Product. AK PETERS LTD. Wellesley, Massachusetts (2008).
5. J.L. Gross, J. Yellen, Graph Theory and Its Applications. Chapman & Hall/CRC, (2006).
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献