IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v112y2008i2p532-547.html
   My bibliography  Save this article

On the value of location information to lot scheduling in complex manufacturing processes

Author

Listed:
  • Thiesse, Frédéric
  • Fleisch, Elgar

Abstract

This research is concerned with the practical use of real-time location systems (RTLSs) in complex manufacturing processes. Starting from the case example of an RFID-based RTLS implementation in a semiconductor fab, we investigate the value of RTLS information on the locations of physical objects in a production system to the problem of efficient job scheduling. For this purpose, we develop a simplified simulation model that captures the main characteristics of the real manufacturing process and propose a set of RTLS-enabled dispatching rules. Our results indicate that the use of RTLS technology provides the opportunity for new levels of process visibility and control in comparison to conventional material-tracking systems. The benefits that can be drawn from the technology include not only an overall acceleration of the existing process but also an additional efficiency gain through novel dispatching rules that take into account real-time information on the logistic processes on the shop floor.

Suggested Citation

  • Thiesse, Frédéric & Fleisch, Elgar, 2008. "On the value of location information to lot scheduling in complex manufacturing processes," International Journal of Production Economics, Elsevier, vol. 112(2), pages 532-547, April.
    • Handle: RePEc:eee:proeco:v:112:y:2008:i:2:p:532-547
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(07)00195-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Nazzal, Dima & Mollaghasemi, Mansooreh & Anderson, Dave, 2006. "A simulation-based evaluation of the cost of cycle time reduction in Agere Systems wafer fabrication facility--a case study," International Journal of Production Economics, Elsevier, vol. 100(2), pages 300-313, April.
    2. R. W. Conway & W. L. Maxwell, 1962. "Network Dispatching by the Shortest-Operation Discipline," Operations Research, INFORMS, vol. 10(1), pages 51-73, February.
    3. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    4. Holthaus, Oliver & Rajendran, Chandrasekharan, 1997. "Efficient dispatching rules for scheduling in a job shop," International Journal of Production Economics, Elsevier, vol. 48(1), pages 87-105, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ngai, Eric W.T. & Cheung, Bernard K.S. & Lam, S.S. & Ng, C.T., 2014. "RFID value in aircraft parts supply chains: A case study," International Journal of Production Economics, Elsevier, vol. 147(PB), pages 330-339.
    2. Tang, Lin & Cao, Hui & Zheng, Li & Huang, Ningjian, 2015. "Value-driven uncertainty-aware data processing for an RFID-enabled mixed-model assembly line," International Journal of Production Economics, Elsevier, vol. 165(C), pages 273-281.
    3. 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.
    4. Kelepouris, Thomas & McFarlane, Duncan, 2010. "Determining the value of asset location information systems in a manufacturing environment," International Journal of Production Economics, Elsevier, vol. 126(2), pages 324-334, August.
    5. Romauch, Martin & Hartl, Richard F., 2017. "Capacity planning for cluster tools in the semiconductor industry," International Journal of Production Economics, Elsevier, vol. 194(C), pages 167-180.
    6. Sławomir Bartoszek & Krzysztof Stankiewicz & Gabriel Kost & Grzegorz Ćwikła & Artur Dyczko, 2021. "Research on Ultrasonic Transducers to Accurately Determine Distances in a Coal Mine Conditions," Energies, MDPI, vol. 14(9), pages 1-22, April.
    7. Ferrer, Geraldo & Heath, Susan K. & Dew, Nicholas, 2011. "An RFID application in large job shop remanufacturing operations," International Journal of Production Economics, Elsevier, vol. 133(2), pages 612-621, October.
    8. Zhou, Wei & Piramuthu, Selwyn, 2013. "Remanufacturing with RFID item-level information: Optimization, waste reduction and quality improvement," International Journal of Production Economics, Elsevier, vol. 145(2), pages 647-657.
    9. Yao, Shiqing & Jiang, Zhibin & Li, Na & Zhang, Huai & Geng, Na, 2011. "A multi-objective dynamic scheduling approach using multiple attribute decision making in semiconductor manufacturing," International Journal of Production Economics, Elsevier, vol. 130(1), pages 125-133, March.
    10. Véronneau, Simon & Roy, Jacques, 2009. "RFID benefits, costs, and possibilities: The economical analysis of RFID deployment in a cruise corporation global service supply chain," International Journal of Production Economics, Elsevier, vol. 122(2), pages 692-702, December.

    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. Romero-Silva, Rodrigo & Shaaban, Sabry & Marsillac, Erika & Hurtado, Margarita, 2018. "Exploiting the characteristics of serial queues to reduce the mean and variance of flow time using combined priority rules," International Journal of Production Economics, Elsevier, vol. 196(C), pages 211-225.
    2. Kasper, T.A. Arno & Land, Martin J. & Teunter, Ruud H., 2023. "Towards System State Dispatching in High‐Variety Manufacturing," Omega, Elsevier, vol. 114(C).
    3. Ali Fırat İnal & Çağrı Sel & Adnan Aktepe & Ahmet Kürşad Türker & Süleyman Ersöz, 2023. "A Multi-Agent Reinforcement Learning Approach to the Dynamic Job Shop Scheduling Problem," Sustainability, MDPI, vol. 15(10), pages 1-24, May.
    4. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    5. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    6. Jacomine Grobler & Andries Engelbrecht & Schalk Kok & Sarma Yadavalli, 2010. "Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time," Annals of Operations Research, Springer, vol. 180(1), pages 165-196, November.
    7. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    8. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
    9. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Longest path analysis in networks of queues: Dynamic scheduling problems," European Journal of Operational Research, Elsevier, vol. 174(1), pages 132-149, October.
    10. Zhang, Rui & Song, Shiji & Wu, Cheng, 2013. "A hybrid artificial bee colony algorithm for the job shop scheduling problem," International Journal of Production Economics, Elsevier, vol. 141(1), pages 167-178.
    11. Christoph Schuster, 2006. "No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 473-491, July.
    12. Branke, Juergen & Pickardt, Christoph W., 2011. "Evolutionary search for difficult problem instances to support the design of job shop dispatching rules," European Journal of Operational Research, Elsevier, vol. 212(1), pages 22-32, July.
    13. Alvarez-Valdes, R. & Fuertes, A. & Tamarit, J. M. & Gimenez, G. & Ramos, R., 2005. "A heuristic to schedule flexible job-shop in a glass factory," European Journal of Operational Research, Elsevier, vol. 165(2), pages 525-534, September.
    14. Varela, Ramiro & Vela, Camino R. & Puente, Jorge & Gomez, Alberto, 2003. "A knowledge-based evolutionary strategy for scheduling problems with bottlenecks," European Journal of Operational Research, Elsevier, vol. 145(1), pages 57-71, February.
    15. Pham, Dinh-Nguyen & Klinkert, Andreas, 2008. "Surgical case scheduling as a generalized job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1011-1025, March.
    16. El-Bouri, A. & Azizi, N. & Zolfaghari, S., 2007. "A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1894-1910, March.
    17. Christophe Sauvey & Wajdi Trabelsi & Nathalie Sauer, 2020. "Mathematical Model and Evaluation Function for Conflict-Free Warranted Makespan Minimization of Mixed Blocking Constraint Job-Shop Problems," Mathematics, MDPI, vol. 8(1), pages 1-17, January.
    18. Dušan Hvalica, 2013. "Solving job shop problems in the context of hypergraphs," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(1), pages 27-40, June.
    19. Pisut Pongchairerks, 2019. "A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem," Complexity, Hindawi, vol. 2019, pages 1-11, March.
    20. Francis Sourd & Wim Nuijten, 2000. "Multiple-Machine Lower Bounds for Shop-Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 341-352, November.

    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:eee:proeco:v:112:y:2008:i:2:p:532-547. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.