In print media industries networked production requires advanced print and media specific job definitions and the communication carrying job relevant information alongside the complete production chain. The relatively young XML based communication standard JDF/JMF allows to specify workflow models and data exchange.Based on an object-oriented approach, a scheduling and modeling framework is proposed, which implements modules for the resources and controls applied in this particular industry. For this framework the available JGAP library is extended to enable modeling of networked print production using the same JDF- /JMF-communication algorithms as applied in the real production. This leads toward a realization of JDF Workflow for operation planning and control of networked print production in digital printing factory environment. This paper theoretically describes and defines a method of expression for execution sequence of JDF Process Nodes and Process Group Nodes using Hierarchical Dependence Graph, meanwhile generates the Connectivity Matrix for practical use. In order to prepare the Device data for scheduling software, a small database has been set up, with functions to manage Device resources.The resolves of limited scheduling problems in the field of traditional and digital printing workflows using genetic algorithm may present its basic principle and algorithms for calculation of Connectivity Matrix of JDF nodes, this shall lead to adding more limitations to broader applications in solving print shop scheduling problems.
Hao Yin, Guangxue Chen, Mirko Segelek, "Solutions of JDF-Workflow Scheduling Problem using Genetic Algorithm" in Proc. IS&T Int'l Conf. on Digital Printing Technologies and Digital Fabrication (NIP29), 2013, pp 102 - 106, https://doi.org/10.2352/ISSN.2169-4451.2013.29.1.art00028_1