IDEAS home Printed from https://ideas.repec.org/p/unm/umamet/2001028.html
   My bibliography  Save this paper

Cost accounting and pricing improvement at Helmond Print: using Xeikon digital colour printing equipment: a case study

Author

Listed:
  • Vergauwen, P.G.M.C.

    (Accounting & Information Management)

  • Busser, K.
  • Rongen, P.
  • Verwaijen, R.
  • Vossen, D.J.L.H.

    (Accounting & Information Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • Vergauwen, P.G.M.C. & Busser, K. & Rongen, P. & Verwaijen, R. & Vossen, D.J.L.H., 2001. "Cost accounting and pricing improvement at Helmond Print: using Xeikon digital colour printing equipment: a case study," Research Memorandum 028, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    • Handle: RePEc:unm:umamet:2001028
    DOI: 10.26481/umamet.2001028
    as

    Download full text from publisher

    File URL: https://cris.maastrichtuniversity.nl/ws/files/1724615/guid-d1f2172c-ddb8-4ad0-8521-b9ee3a8a884e-ASSET1.0.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.26481/umamet.2001028?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. Dorit S. Hochbaum & Ron Shamir, 1991. "Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem," Operations Research, INFORMS, vol. 39(4), pages 648-653, August.
    2. John Miltenburg, 1989. "Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems," Management Science, INFORMS, vol. 35(2), pages 192-207, February.
    3. H. A. Eiselt & Michel Gendreau & Gilbert Laporte, 1995. "Arc Routing Problems, Part I: The Chinese Postman Problem," Operations Research, INFORMS, vol. 43(2), pages 231-242, April.
    4. Harilaos N. Psaraftis, 1980. "A Dynamic Programming Approach for Sequencing Groups of Identical Jobs," Operations Research, INFORMS, vol. 28(6), pages 1347-1359, December.
    5. Wieslaw Kubiak & George Steiner & Julian Scott Yeomans, 1997. "Optimal level schedules for mixed-model, multi-level just-in-time assembly systems," Annals of Operations Research, Springer, vol. 69(0), pages 241-259, January.
    6. H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
    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. N. Brauner & Y. Crama & A. Grigoriev & J. Klundert, 2005. "A Framework for the Complexity of High-Multiplicity Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 313-323, May.
    2. Klaus Jansen & Roberto Solis-Oba, 2011. "A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 743-753, November.
    3. Drexl, Andreas & Kimms, Alf, 1999. "Belastungsorientierte Just-in-Time Variantenfließfertigung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 502, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "Sequencing mixed-model assembly lines: Survey, classification and model critique," European Journal of Operational Research, Elsevier, vol. 192(2), pages 349-373, January.
    5. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "The product rate variation problem and its relevance in real world mixed-model assembly lines," European Journal of Operational Research, Elsevier, vol. 197(2), pages 818-824, September.
    6. Zhu, Jin & Ding, Fong-Yuen, 2000. "A transformed two-stage method for reducing the part-usage variation and a comparison of the product-level and part-level solutions in sequencing mixed-model assembly lines," European Journal of Operational Research, Elsevier, vol. 127(1), pages 203-216, November.
    7. Mansouri, S. Afshin, 2005. "A Multi-Objective Genetic Algorithm for mixed-model sequencing on JIT assembly lines," European Journal of Operational Research, Elsevier, vol. 167(3), pages 696-716, December.
    8. Aigbedo, Henry, 2007. "An assessment of the effect of mass customization on suppliers' inventory levels in a JIT supply chain," European Journal of Operational Research, Elsevier, vol. 181(2), pages 704-715, September.
    9. S. Thomas McCormick & Scott R. Smallwood & Frits C. R. Spieksma, 2001. "A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths," Mathematics of Operations Research, INFORMS, vol. 26(1), pages 31-49, February.
    10. Ahmed Ghoniem & Hanif D. Sherali & Hojong Baik, 2014. "Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 514-530, August.
    11. M. Köppe & M. Queyranne & C. T. Ryan, 2010. "Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 137-150, July.
    12. K. Aardal & R. E. Bixby & C. A. J. Hurkens & A. K. Lenstra & J. W. Smeltink, 2000. "Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 192-202, August.
    13. A R Brentnall & R C H Cheng, 2009. "Some effects of aircraft arrival sequence algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 962-972, July.
    14. Corberan, A. & Sanchis, J. M., 1998. "The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra," European Journal of Operational Research, Elsevier, vol. 108(3), pages 538-550, August.
    15. Albert Corominas & Alberto García-Villoria & Rafael Pastor, 2013. "Metaheuristic algorithms hybridised with variable neighbourhood search for solving the response time variability problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 296-312, July.
    16. Gupta, Jatinder N. D. & Ho, Johnny C., 1996. "Scheduling with two job classes and setup times to minimize the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 42(3), pages 205-216, April.
    17. Kim, Yeong-Dae & Lee, Dong-Ho & Yoon, Chi-Moon, 2001. "Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems," European Journal of Operational Research, Elsevier, vol. 133(3), pages 624-634, September.
    18. Zhou, Wei & Piramuthu, Selwyn, 2012. "Manufacturing with item-level RFID information: From macro to micro quality control," International Journal of Production Economics, Elsevier, vol. 135(2), pages 929-938.
    19. Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer, 2016. "Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 511-530, May.
    20. John Sniezek & Lawrence Bodin, 2006. "Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles," Annals of Operations Research, Springer, vol. 144(1), pages 33-58, April.

    More about this item

    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:unm:umamet:2001028. 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: Andrea Willems or Leonne Portz (email available below). General contact details of provider: https://edirc.repec.org/data/meteonl.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.