IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v54y2003i10d10.1057_palgrave.jors.2601601.html
   My bibliography  Save this article

A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system

Author

Listed:
  • G-C Lee

    (Korea Advanced Institute of Science and Technology, Yusong-gu)

  • Y-D Kim

    (Korea Advanced Institute of Science and Technology, Yusong-gu)

  • J-G Kim

    (School of Industrial and Systems Engineering, Georgia Institute of Technology)

  • S-H Choi

    (Faculty of e-Business, Daebul University, Youngam-Gun)

Abstract

This paper focuses on a production-scheduling problem in a printed circuit board (PCB) manufacturing system that produces multiple product types with different due dates and different manufacturing processes. In the PCB manufacturing system, there is a number of serial workstations, and there are multiple parallel machines at each workstation. Also, setup operations are required at certain workstations or machines, and some product types have re-entrant flows. We develop new dispatching rules for scheduling at each workstation, considering the special features of PCB manufacturing. With the dispatching rules, we determine not only the start time of each lot at a machine but also the batch size of each product at each machine. Simulation experiments are carried out to test the performance of the production-scheduling method and dispatching rules devised in this study. Results show that the production-scheduling method suggested in this study performs better than methods with well-known dispatching rules and heuristic algorithms for lot sizing in terms of the total tardiness of orders.

Suggested Citation

  • G-C Lee & Y-D Kim & J-G Kim & S-H Choi, 2003. "A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1038-1049, October.
    • Handle: RePEc:pal:jorsoc:v:54:y:2003:i:10:d:10.1057_palgrave.jors.2601601
    DOI: 10.1057/palgrave.jors.2601601
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601601
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601601?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
    ---><---

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

    References listed on IDEAS

    as
    1. Ari P. J. Vepsalainen & Thomas E. Morton, 1987. "Priority Rules for Job Shops with Weighted Tardiness Costs," Management Science, INFORMS, vol. 33(8), pages 1035-1047, August.
    2. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    3. M K Ng, 2000. "Clustering methods for printed circuit board insertion problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(10), pages 1205-1211, October.
    4. Gregory Dobson, 1987. "The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes," Operations Research, INFORMS, vol. 35(5), pages 764-771, October.
    5. Salah E. Elmaghraby, 1978. "The Economic Lot Scheduling Problem (ELSP): Review and Extensions," Management Science, INFORMS, vol. 24(6), pages 587-598, February.
    6. Brah, Shaukat A. & Hunsucker, John L., 1991. "Branch and bound algorithm for the flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 51(1), pages 88-99, March.
    7. S. S. Panwalkar & Wafik Iskander, 1977. "A Survey of Scheduling Rules," Operations Research, INFORMS, vol. 25(1), pages 45-61, February.
    8. Dengiz, Berna & Akbay, Kunter S., 2000. "Computer simulation of a PCB production line: metamodeling approach," International Journal of Production Economics, Elsevier, vol. 63(2), pages 195-205, January.
    9. I Moon & B C Giri & K Choi, 2002. "Economic lot scheduling problem with imperfect production processes and setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(6), pages 620-629, June.
    10. Uday S. Karmarkar & Sham Kekre & Sunder Kekre & Susan Freeman, 1985. "Lot-Sizing and Lead-time Performance in a Manufacturing Cell," Interfaces, INFORMS, vol. 15(2), pages 1-9, April.
    11. C. Loren Doll & D. Clay Whybark, 1973. "An Iterative Procedure for the Single-Machine Multi-Product Lot Scheduling Problem," Management Science, INFORMS, vol. 20(1), pages 50-55, September.
    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. Beck, Fabian G. & Biel, Konstantin & Glock, Christoph H., 2019. "Integration of energy aspects into the economic lot scheduling problem," International Journal of Production Economics, Elsevier, vol. 209(C), pages 399-410.
    2. Van den broecke, Frank & Van Landeghem, Hendrik & Aghezzaf, El-Houssaine, 2008. "Implementing a near-optimal solution for the multi-stage, multi-product capacitated lot-sizing problem by rolling out a cyclical production plan," International Journal of Production Economics, Elsevier, vol. 112(1), pages 121-137, March.
    3. Khouja, Moutaz & Michalewicz, Zgibniew & Wilmot, Michael, 1998. "The use of genetic algorithms to solve the economic lot size scheduling problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 509-524, November.
    4. McGee, Victor E. & Pyke, David F., 1996. "Periodic production scheduling at a fastener manufacturer," International Journal of Production Economics, Elsevier, vol. 46(1), pages 65-87, December.
    5. Serge M. Karalli & A. Dale Flowers, 2006. "The Multiple-Family ELSP with Safety Stocks," Operations Research, INFORMS, vol. 54(3), pages 523-531, June.
    6. Vidal-Carreras, Pilar I. & Garcia-Sabater, Jose P. & Coronado-Hernandez, Jairo R., 2012. "Economic lot scheduling with deliberated and controlled coproduction," European Journal of Operational Research, Elsevier, vol. 219(2), pages 396-404.
    7. Fransoo, Jan C. & Sridharan, V. & Bertrand, J.Will M., 1995. "A hierarchical approach for capacity coordination in multiple products single-machine production systems with stationary stochastic demands," European Journal of Operational Research, Elsevier, vol. 86(1), pages 57-72, October.
    8. Salvietti, Luciano & Smith, Neale R., 2008. "A profit-maximizing economic lot scheduling problem with price optimization," European Journal of Operational Research, Elsevier, vol. 184(3), pages 900-914, February.
    9. Holmbom, Martin & Segerstedt, Anders, 2014. "Economic Order Quantities in production: From Harris to Economic Lot Scheduling Problems," International Journal of Production Economics, Elsevier, vol. 155(C), pages 82-90.
    10. Carstensen, Peter, 1997. "Das Economic Lot Scheduling Problem: Überblick und LP-basiertes Verfahren," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 465, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Briskorn, Dirk & Zeise, Philipp & Packowski, Josef, 2016. "Quasi-fixed cyclic production schemes for multiple products with stochastic demand," European Journal of Operational Research, Elsevier, vol. 252(1), pages 156-169.
    12. Khouja, Moutaz, 1997. "The scheduling of economic lot sizes on volume flexible production systems," International Journal of Production Economics, Elsevier, vol. 48(1), pages 73-86, January.
    13. Wagner, Bret J. & Davis, Darwin J., 2002. "A search heuristic for the sequence-dependent economic lot scheduling problem," European Journal of Operational Research, Elsevier, vol. 141(1), pages 133-146, August.
    14. Grznar, J. & Riggle, C., 1997. "An optimal algorithm for the basic period approach to the economic lot scheduling problem," Omega, Elsevier, vol. 25(3), pages 355-364, June.
    15. Sağlam, Ümit & Banerjee, Avijit, 2018. "Integrated multiproduct batch production and truck shipment scheduling under different shipping policies," Omega, Elsevier, vol. 74(C), pages 70-81.
    16. Ramesh Bollapragada & Uday Rao, 1999. "Single-Stage Resource Allocation and Economic Lot Scheduling on Multiple, Nonidentical Production Lines," Management Science, INFORMS, vol. 45(6), pages 889-904, June.
    17. Bierwirth, C. & Kuhpfahl, J., 2017. "Extended GRASP for the job shop scheduling problem with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 261(3), pages 835-848.
    18. Robert R. Inman & Philip C. Jones & Guillermo M. Gallego, 1991. "Economic lot scheduling of fully loaded processes with external setups," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 699-713, October.
    19. M. Vimala Rani & M. Mathirajan, 2020. "Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace," OPSEARCH, Springer;Operational Research Society of India, vol. 57(2), pages 462-512, June.
    20. David M. Markowitz & Martin I. Reiman & Lawrence M. Wein, 2000. "The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies," Operations Research, INFORMS, vol. 48(1), pages 136-154, February.

    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:pal:jorsoc:v:54:y:2003:i:10:d:10.1057_palgrave.jors.2601601. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.