[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/h/wsi/wschap/9789814280280_0024.html
   My bibliography  Save this book chapter

A Prioritization Algorithm for Configuration Scheduling in a Mass Customization Environment

In: Handbook of Research in Mass Customization and Personalization (In 2 Volumes)

Author

Listed:
  • Ashok Kumar

    (Department of Management, Grand Valley State University, USA)

  • Frank T. Piller

    (Technology and Innovation Management Group, RWTH Aachen University, Germany)

Abstract
Mass customization (MC) as a business strategy seeks to deliver highly customized product to customers at affordable prices that are consistent with mass production efficiencies. Despite a significant volume of research in mass customization, a severe paucity of work in quantitative areas related to operations management, such as scheduling, inventory control, distribution systems, statistical process control, etc. has been well documented. In this chapter, we begin to fill this gap by proposing a methodology for scheduling the production of an arbitrary number of configurations of a product when the production budget and time are limited. A specific contribution of this chapter relates to the development of three measures of the value associated with each configuration of the product. These measures are more general than the profit motive usually employed in scheduling configurations. These measures depend on cost proportion, profit proportion, and a hybrid of these two measures. Using these value measures, we formulate a mixed integer linear programming model that would yield an optimal sequence of configurations to maximize the total value of the production over a given period. Dual constraints on budget and production time make the problem NP Hard in strong sense. These are reducible to 2-dimensional Bin packing or Knapsack problem after elimination of certain constraints. Given the dynamic nature of configuration demands and constantly evolving system state, an efficient heuristic solution with tight bounds that can be developed quickly is considered preferable over an optimal solution that takes long time and substantial computer resources to develop. Accordingly, two heuristic solutions are constructed that are quick as well as efficient.

Suggested Citation

  • Ashok Kumar & Frank T. Piller, 2009. "A Prioritization Algorithm for Configuration Scheduling in a Mass Customization Environment," World Scientific Book Chapters, in: Frank T Piller & Mitchell M Tseng (ed.), Handbook of Research in Mass Customization and Personalization (In 2 Volumes), chapter 24, pages 487-512, World Scientific Publishing Co. Pte. Ltd..
    • Handle: RePEc:wsi:wschap:9789814280280_0024
    as

    Download full text from publisher

    File URL: https://www.worldscientific.com/doi/pdf/10.1142/9789814280280_0024
    Download Restriction: Ebook Access is available upon purchase.
    File URL: https://www.worldscientific.com/doi/abs/10.1142/9789814280280_0024
    Download Restriction: Ebook Access is available upon purchase.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:wschap:9789814280280_0024. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscientific.com/page/worldscibooks .

    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.