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

Optimal booking of machines in a virtual job-shop with stochastic processing times to minimize total machine rental and job tardiness costs

Author

Listed:
  • Laslo, Zohar
  • Golenko-Ginzburg, Dimitri
  • Keren, Baruch

Abstract

No abstract is available for this item.

Suggested Citation

  • Laslo, Zohar & Golenko-Ginzburg, Dimitri & Keren, Baruch, 2008. "Optimal booking of machines in a virtual job-shop with stochastic processing times to minimize total machine rental and job tardiness costs," International Journal of Production Economics, Elsevier, vol. 111(2), pages 812-821, February.
    • Handle: RePEc:eee:proeco:v:111:y:2008:i:2:p:812-821
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(07)00171-5
    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. Slowinski, Roman, 1981. "Multiobjective network scheduling with efficient use of renewable and nonrenewable resources," European Journal of Operational Research, Elsevier, vol. 7(3), pages 265-273, July.
    2. Chang, Pei-Chann & Hsieh, Jih-Chang & Lin, Shui-Geng, 2002. "The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 79(3), pages 171-183, October.
    3. Varadharajan, T.K. & Rajendran, Chandrasekharan, 2005. "A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs," European Journal of Operational Research, Elsevier, vol. 167(3), pages 772-795, December.
    4. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
    5. Aytug, Haldun & Lawley, Mark A. & McKay, Kenneth & Mohan, Shantha & Uzsoy, Reha, 2005. "Executing production schedules in the face of uncertainties: A review and some future directions," European Journal of Operational Research, Elsevier, vol. 161(1), pages 86-110, February.
    6. Elmaghraby, S. E. & Ferreira, A. A. & Tavares, L. V., 2000. "Optimal start times under stochastic activity durations," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 153-164, March.
    7. Trietsch, Dan, 1993. "Scheduling flights at hub airports," Transportation Research Part B: Methodological, Elsevier, vol. 27(2), pages 133-150, April.
    8. Golenko-Ginzburg, Dimitri & Gonik, Aharon, 2002. "Optimal job-shop scheduling with random operations and cost objectives," International Journal of Production Economics, Elsevier, vol. 76(2), pages 147-157, March.
    9. Speranza, M. Grazia & Vercellis, Carlo, 1993. "Hierarchical models for multi-project planning and scheduling," European Journal of Operational Research, Elsevier, vol. 64(2), pages 312-325, January.
    10. Soroush, H. M., 1999. "Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 113(2), pages 450-468, March.
    11. Golenko-Ginzburg, Dimitri & Kesler, Shmuel & Landsman, Zinoviy, 1995. "Industrial job-shop scheduling with random operations and different priorities," International Journal of Production Economics, Elsevier, vol. 40(2-3), pages 185-195, August.
    12. Soroush, H. M. & Fredendall, L. D., 1994. "The stochastic single machine scheduling problem with earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 77(2), pages 287-302, September.
    13. 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.
    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. Laslo, Zohar & Gurevich, Gregory & Keren, Baruch, 2009. "Economic distribution of budget among producers for fulfilling orders under delivery chance constraints," International Journal of Production Economics, Elsevier, vol. 122(2), pages 656-662, December.
    2. Al-Hinai, Nasr & ElMekkawy, T.Y., 2011. "Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm," International Journal of Production Economics, Elsevier, vol. 132(2), pages 279-291, August.

    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. Baker, Kenneth R. & Trietsch, Dan, 2009. "Safe scheduling: Setting due dates in single-machine problems," European Journal of Operational Research, Elsevier, vol. 196(1), pages 69-77, July.
    2. Al-Hinai, Nasr & ElMekkawy, T.Y., 2011. "Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm," International Journal of Production Economics, Elsevier, vol. 132(2), pages 279-291, August.
    3. Trietsch, Dan & Mazmanyan, Lilit & Gevorgyan, Lilit & Baker, Kenneth R., 2012. "Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation," European Journal of Operational Research, Elsevier, vol. 216(2), pages 386-396.
    4. Xiong, Jian & Xing, Li-ning & Chen, Ying-wu, 2013. "Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns," International Journal of Production Economics, Elsevier, vol. 141(1), pages 112-126.
    5. Altekin, F. Tevhide & Bukchin, Yossi, 2022. "A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing," European Journal of Operational Research, Elsevier, vol. 301(1), pages 235-253.
    6. Servranckx, Tom & Vanhoucke, Mario, 2019. "Strategies for project scheduling with alternative subgraphs under uncertainty: similar and dissimilar sets of schedules," European Journal of Operational Research, Elsevier, vol. 279(1), pages 38-53.
    7. Shichang Xiao & Zigao Wu & Hongyan Dui, 2022. "Resilience-Based Surrogate Robustness Measure and Optimization Method for Robust Job-Shop Scheduling," Mathematics, MDPI, vol. 10(21), pages 1-22, October.
    8. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    9. Moukrim, Aziz & Quilliot, Alain & Toussaint, Hélène, 2015. "An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration," European Journal of Operational Research, Elsevier, vol. 244(2), pages 360-368.
    10. Selcuk Goren & Ihsan Sabuncuoglu & Utku Koc, 2012. "Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 26-38, February.
    11. Briand, Cyril & La, H. Trung & Erschler, Jacques, 2006. "A new sufficient condition of optimality for the two-machine flowshop problem," European Journal of Operational Research, Elsevier, vol. 169(3), pages 712-722, March.
    12. Ali Salmasnia & Mostafa Khatami & Reza Kazemzadeh & Seyed Zegordi, 2015. "Bi-objective single machine scheduling problem with stochastic processing times," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 275-297, April.
    13. Lemos, R.F. & Ronconi, D.P., 2015. "Heuristics for the stochastic single-machine problem with E/T costs," International Journal of Production Economics, Elsevier, vol. 168(C), pages 131-142.
    14. Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).
    15. Van Peteghem, Vincent & Vanhoucke, Mario, 2014. "An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances," European Journal of Operational Research, Elsevier, vol. 235(1), pages 62-72.
    16. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Modelling complex assemblies as a queueing network for lead time control," European Journal of Operational Research, Elsevier, vol. 174(1), pages 150-168, October.
    17. Illana Bendavid & Boaz Golany, 2009. "Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology," Annals of Operations Research, Springer, vol. 172(1), pages 259-276, November.
    18. Hadda, Hatem & Dridi, Najoua & Hajji, Mohamed Karim, 2018. "On the optimality conditions of the two-machine flow shop problem," European Journal of Operational Research, Elsevier, vol. 266(2), pages 426-435.
    19. Boctor, Fayez F., 1996. "A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes," European Journal of Operational Research, Elsevier, vol. 90(2), pages 349-361, April.
    20. Amir Mokhtari & Jane M. Van Doren, 2019. "An Agent‐Based Model for Pathogen Persistence and Cross‐Contamination Dynamics in a Food Facility," Risk Analysis, John Wiley & Sons, vol. 39(5), pages 992-1021, May.

    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:111:y:2008:i:2:p:812-821. 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.