By Topic

Digital print workflow optimization under due-dates, opportunity cost and resource constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
Mukesh Agrawal ; Electrical and Computer Engineering, Duke University ; Qing Duan ; Krishnendu Chakrabarty ; Jun Zeng
more authors

On-demand digital printing is an example of emerging personalized manufacturing services. It provides unique opportunities to automate the printing process, enhance productivity, and better utilize resources such as equipment, servers and IT infrastructure. In this work, we present a unified solution approach to solve an important optimization problem in digital printing, viz., simultaneous mapping of component tasks of a print job to time steps (scheduling), selection of resources for these tasks, and mapping of tasks to resources (binding). We model print jobs, the relationships between them, and dependencies between tasks within a job, in terms of sequencing graphs. This formal representation is then used for scheduling and resource binding. The optimization objective is to enable justin-time manufacturing, that is, to minimize both the slack time (the duration between the delivery deadline and the completion time of the order) and the opportunity cost for job orders. The proposed approach uses genetic algorithms (GA) to systematically search the space of feasible solutions. The fitness function of the GA is carefully crafted to match the optimization objective. An integer linear programming (ILP) model is described to evaluate the GA heuristic by deriving optimal solutions for small problem instances. The optimization technique is further evaluated using print orders from a commercial print service provider and compared to baseline methods commonly implemented in the industrial settings.

Published in:

2011 9th IEEE International Conference on Industrial Informatics

Date of Conference:

26-29 July 2011