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

The Weibull scheduling index for client driven manufacturing processes

Author

Listed:
  • Mallor, Fermin
  • Guardiola, Ivan G.

Abstract

This paper highlights a new dispatching rule based on an index developed from a modified two parameter Weibull probability distribution function. This new dispatching rule is named the Weibull Urgency Index (WUI), which uses the capability of the Weibull function's generation of unique curves to develop an index behavior based on job type. Hence, this unique index curve reflects how a job will behave within the queue. The paper describes in detail the development of this new heuristic function and it is compared to the well established Apparent Tardiness Cost (ATC) dispatching rule through a simulation study. The new index is tested in a stochastic environment where jobs arrive randomly and the processing time of the jobs is also not completely known.

Suggested Citation

  • Mallor, Fermin & Guardiola, Ivan G., 2014. "The Weibull scheduling index for client driven manufacturing processes," International Journal of Production Economics, Elsevier, vol. 150(C), pages 225-238.
    • Handle: RePEc:eee:proeco:v:150:y:2014:i:c:p:225-238
    DOI: 10.1016/j.ijpe.2014.01.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527314000036
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2014.01.001?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. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    2. Chen, Binchao & Matis, Timothy I., 2013. "A flexible dispatching rule for minimizing tardiness in job shop scheduling," International Journal of Production Economics, Elsevier, vol. 141(1), pages 360-365.
    3. Jouglet, Antoine & Savourey, David & Carlier, Jacques & Baptiste, Philippe, 2008. "Dominance-based heuristics for one-machine total cost scheduling problems," European Journal of Operational Research, Elsevier, vol. 184(3), pages 879-899, February.
    4. Joseph Adams & Egon Balas & Daniel Zawack, 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling," Management Science, INFORMS, vol. 34(3), pages 391-401, March.
    5. 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.
    6. 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.
    7. Anghinolfi, Davide & Paolucci, Massimo, 2009. "A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 193(1), pages 73-85, February.
    8. Vinod, V. & Sridharan, R., 2011. "Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system," International Journal of Production Economics, Elsevier, vol. 129(1), pages 127-146, 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. Jing, Hao & Sheng, Lijuan & Luo, Chaorui & Kwak, Choonjong, 2021. "Statistical analysis of family based dispatching rules and preemption," International Journal of Production Economics, Elsevier, vol. 240(C).

    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. Xiong, Hegen & Fan, Huali & Jiang, Guozhang & Li, Gongfa, 2017. "A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints," European Journal of Operational Research, Elsevier, vol. 257(1), pages 13-24.
    2. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    3. Tanja Mlinar & Philippe Chevalier, 2016. "Pooling heterogeneous products for manufacturing environments," 4OR, Springer, vol. 14(2), pages 173-200, June.
    4. Raúl Mencía & Carlos Mencía, 2021. "One-Machine Scheduling with Time-Dependent Capacity via Efficient Memetic Algorithms," Mathematics, MDPI, vol. 9(23), pages 1-24, November.
    5. Michael Pinedo & Marcos Singer, 1999. "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 1-17, February.
    6. A. S. Xanthopoulos & D. E. Koulouriotis, 2018. "Cluster analysis and neural network-based metamodeling of priority rules for dynamic sequencing," Journal of Intelligent Manufacturing, Springer, vol. 29(1), pages 69-91, January.
    7. 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.
    8. Ouenniche, J. & Bertrand, J. W. M., 2001. "The finite horizon economic lot sizing problem in job shops: : the multiple cycle approach," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 49-61, December.
    9. Yi Tan & Lars Mönch & John W. Fowler, 2018. "A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines," Journal of Scheduling, Springer, vol. 21(2), pages 209-226, April.
    10. Chen, Yin-Yann & Cheng, Chen-Yang & Wang, Li-Chih & Chen, Tzu-Li, 2013. "A hybrid approach based on the variable neighborhood search and particle swarm optimization for parallel machine scheduling problems—A case study for solar cell industry," International Journal of Production Economics, Elsevier, vol. 141(1), pages 66-78.
    11. Braune, R. & Zäpfel, G. & Affenzeller, M., 2012. "An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 218(1), pages 76-85.
    12. P Corry & E Kozan, 2004. "Job scheduling with technical constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 160-169, February.
    13. Kasper, T.A. Arno & Land, Martin J. & Teunter, Ruud H., 2023. "Towards System State Dispatching in High‐Variety Manufacturing," Omega, Elsevier, vol. 114(C).
    14. Jayamohan, M. S. & Rajendran, Chandrasekharan, 2004. "Development and analysis of cost-based dispatching rules for job shop scheduling," European Journal of Operational Research, Elsevier, vol. 157(2), pages 307-321, September.
    15. S. David Wu & Eui-Seok Byeon & Robert H. Storer, 1999. "A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness," Operations Research, INFORMS, vol. 47(1), pages 113-124, February.
    16. 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.
    17. Mattfeld, Dirk C. & Bierwirth, Christian, 2004. "An efficient genetic algorithm for job shop scheduling with tardiness objectives," European Journal of Operational Research, Elsevier, vol. 155(3), pages 616-630, June.
    18. Gabriel Mauricio Zambrano-Rey & Eliana María González-Neira & Gabriel Fernando Forero-Ortiz & María José Ocampo-Monsalve & Andrea Rivera-Torres, 2024. "Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns," Annals of Operations Research, Springer, vol. 338(1), pages 801-833, July.
    19. Monch, Lars & Schabacker, Rene & Pabst, Detlef & Fowler, John W., 2007. "Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2100-2118, March.
    20. 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.

    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:150:y:2014:i:c:p:225-238. 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.