IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v39y2009i1p69-90.html
   My bibliography  Save this article

LDP Lean Document Production---O.R.-Enhanced Productivity Improvements for the Printing Industry

Author

Listed:
  • Sudhendu Rai

    (Xerox Innovation Group, Fairport, New York 14450)

  • Charles B. Duke

    (Xerox Innovation Group, Webster, New York 14580)

  • Vaughn Lowe

    (Xerox Services, Centreville, Virginia 20120)

  • Cyndi Quan-Trotter

    (Xerox Services, Seattle, Washington 98146)

  • Thomas Scheermesser

    (Xerox GmbH, 41460 Neuss, Germany)

Abstract

Xerox has invented, tested, and implemented a novel class of operations-research-based productivity-improvement offerings, trademarked LDP Lean Document Production® solutions, for the $100 billion printing industry in the United States. These solutions, which Xerox has implemented in approximately 100 sites to date, have provided dramatic productivity and cost improvements for both print shops and document-manufacturing facilities, as measured by reductions of 20--40 percent in revenue-per-unit labor cost. They have generated approximately $200 million of incremental profit across the Xerox customer value chain since their initial introduction in 2000. The offerings have extended the use of operations research to small- and medium-sized print shops, while increasing the scope of its application to large document-production facilities.

Suggested Citation

  • Sudhendu Rai & Charles B. Duke & Vaughn Lowe & Cyndi Quan-Trotter & Thomas Scheermesser, 2009. "LDP Lean Document Production---O.R.-Enhanced Productivity Improvements for the Printing Industry," Interfaces, INFORMS, vol. 39(1), pages 69-90, February.
    • Handle: RePEc:inm:orinte:v:39:y:2009:i:1:p:69-90
    DOI: 10.1287/inte.1080.0413
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1080.0413
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.1080.0413?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Peter J. M. van Laarhoven & Emile H. L. Aarts & Jan Karel Lenstra, 1992. "Job Shop Scheduling by Simulated Annealing," Operations Research, INFORMS, vol. 40(1), pages 113-125, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lingye Tan & Tiong Lee Kong & Ziyang Zhang & Ahmed Sayed M. Metwally & Shubham Sharma & Kanta Prasad Sharma & Sayed M. Eldin & Dominik Zimon, 2023. "Scheduling and Controlling Production in an Internet of Things Environment for Industry 4.0: An Analysis and Systematic Review of Scientific Metrological Data," Sustainability, MDPI, vol. 15(9), pages 1-37, May.
    2. Z C Zhu & K M Ng & H L Ong, 2010. "A modified tabu search algorithm for cost-based job shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 611-619, April.
    3. Roberto Casarin & Bertrand B. Maillet & Anthony Osuntuyi, 2024. "Monte carlo within simulated annealing for integral constrained optimizations," Annals of Operations Research, Springer, vol. 334(1), pages 205-240, March.
    4. P M E Shutler, 2003. "A priority list based heuristic for the job shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 571-584, June.
    5. Jeffrey W. Ohlmann & Barrett W. Thomas, 2007. "A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 80-90, February.
    6. Hassan Benchekroun, 2007. "A Unifying Differential Game Of Advertising And Promotions," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 9(02), pages 183-197.
    7. Berterottière, Lucas & Dauzère-Pérès, Stéphane & Yugma, Claude, 2024. "Flexible job-shop scheduling with transportation resources," European Journal of Operational Research, Elsevier, vol. 312(3), pages 890-909.
    8. Jianjun Jiao & Lansun Chen, 2007. "Global Attractivity And Permanence Of A Stage-Structured Pest Managementsimodel With Time Delay And Diseased Pests Impulsive Transmission," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 10(04), pages 479-494.
    9. Xiujuan Zhao & Wei Xu & Yunjia Ma & Fuyu Hu, 2015. "Scenario-Based Multi-Objective Optimum Allocation Model for Earthquake Emergency Shelters Using a Modified Particle Swarm Optimization Algorithm: A Case Study in Chaoyang District, Beijing, China," PLOS ONE, Public Library of Science, vol. 10(12), pages 1-16, December.
    10. Thi-Kien Dao & Tien-Szu Pan & Trong-The Nguyen & Jeng-Shyang Pan, 2018. "Parallel bat algorithm for optimizing makespan in job shop scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 451-462, February.
    11. Wael Korani & Malek Mouhoub, 2021. "Review on Nature-Inspired Algorithms," SN Operations Research Forum, Springer, vol. 2(3), pages 1-26, September.
    12. Karen Aardal & Cor Hurkens & Jan Karel Lenstra & Sergey Tiourine, 2002. "Algorithms for Radio Link Frequency Assignment: The Calma Project," Operations Research, INFORMS, vol. 50(6), pages 968-980, December.
    13. Bernard Gendron & Alain Hertz & Patrick St-Louis, 2007. "On edge orienting methods for graph coloring," Journal of Combinatorial Optimization, Springer, vol. 13(2), pages 163-178, February.
    14. Philippe Lacomme & Aziz Moukrim & Alain Quilliot & Marina Vinot, 2019. "Integration of routing into a resource-constrained project scheduling problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(4), pages 421-464, December.
    15. Ravi Kumar & Surya Prakash Singh, 2018. "Simulated Annealing-Based Embedded Meta-Heuristic Approach to Solve Bi-objective Robust Stochastic Sustainable Cellular Layout," Global Journal of Flexible Systems Management, Springer;Global Institute of Flexible Systems Management, vol. 19(1), pages 69-93, March.
    16. Edzard Weber & Anselm Tiefenbacher & Norbert Gronau, 2019. "Need for Standardization and Systematization of Test Data for Job-Shop Scheduling," Data, MDPI, vol. 4(1), pages 1-21, February.
    17. Ming Zhang & Yang Lu & Youxi Hu & Nasser Amaitik & Yuchun Xu, 2022. "Dynamic Scheduling Method for Job-Shop Manufacturing Systems by Deep Reinforcement Learning with Proximal Policy Optimization," Sustainability, MDPI, vol. 14(9), pages 1-16, April.
    18. Selcuk Goren & Ihsan Sabuncuoglu & Utku Koc, 2012. "Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 26-38, February.
    19. T. C. E. Cheng & Bo Peng & Zhipeng Lü, 2016. "A hybrid evolutionary algorithm to solve the job shop scheduling problem," Annals of Operations Research, Springer, vol. 242(2), pages 223-237, July.
    20. Lu, Mengshi & Nakao, Hideaki & Shen, Siqian & Zhao, Lin, 2021. "Non-profit resource allocation and service scheduling with cross-subsidization and uncertain resource consumptions," Omega, Elsevier, vol. 99(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:39:y:2009:i:1:p:69-90. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.