IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v165y2005i2p314-328.html
   My bibliography  Save this article

Maximization of solution flexibility for robust shop scheduling

Author

Listed:
  • Artigues, Christian
  • Billaut, Jean-Charles
  • Esswein, Carl

Abstract

No abstract is available for this item.

Suggested Citation

  • Artigues, Christian & Billaut, Jean-Charles & Esswein, Carl, 2005. "Maximization of solution flexibility for robust shop scheduling," European Journal of Operational Research, Elsevier, vol. 165(2), pages 314-328, September.
    • Handle: RePEc:eee:ejores:v:165:y:2005:i:2:p:314-328
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00242-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. 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.
    2. 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.
    3. 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. Kaut, Michal & Vaagen, Hajnalka & Wallace, Stein W., 2021. "The combined impact of stochastic and correlated activity durations and design uncertainty on project plans," International Journal of Production Economics, Elsevier, vol. 233(C).
    2. Shichang Xiao & Shudong Sun & Jionghua (Judy) Jin, 2017. "Surrogate Measures for the Robust Scheduling of Stochastic Job Shop Scheduling Problems," Energies, MDPI, vol. 10(4), pages 1-26, April.
    3. 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.
    4. Dmitry Ivanov & Alexandre Dolgui & Boris Sokolov & Frank Werner, 2016. "Schedule robustness analysis with the help of attainable sets in continuous flow problem under capacity disruptions," International Journal of Production Research, Taylor & Francis Journals, vol. 54(11), pages 3397-3413, June.
    5. Cardin, Olivier & Mebarki, Nasser & Pinot, Guillaume, 2013. "A study of the robustness of the group scheduling method using an emulation of a complex FMS," International Journal of Production Economics, Elsevier, vol. 146(1), pages 199-207.
    6. Vaagen, Hajnalka & Kaut, Michal & Wallace, Stein W., 2017. "The impact of design uncertainty in engineer-to-order project planning," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1098-1109.

    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. 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.
    2. 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.
    3. 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.
    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. Frederix, Florent, 2001. "An extended enterprise planning methodology for the discrete manufacturing industry," European Journal of Operational Research, Elsevier, vol. 129(2), pages 317-325, March.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    12. 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.
    13. 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.
    14. Morteza Davari & Erik Demeulemeester, 2019. "The proactive and reactive resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 22(2), pages 211-237, April.
    15. 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.
    16. Ramalhinho Lourenco, Helena, 1996. "Sevast'yanov's algorithm for the flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 176-189, May.
    17. Lamas, Patricio & Goycoolea, Marcos & Pagnoncelli, Bernardo & Newman, Alexandra, 2024. "A target-time-windows technique for project scheduling under uncertainty," European Journal of Operational Research, Elsevier, vol. 314(2), pages 792-806.
    18. Taudes, Alfred & Trcka, Michael & Lukanowicz, Martin, 2002. "Organizational learning in production networks," Journal of Economic Behavior & Organization, Elsevier, vol. 47(2), pages 141-163, February.
    19. D J Stewardson & R I Whitfield, 2004. "A demonstration of the utility of fractional experimental design for finding optimal genetic algorithm parameter settings," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 132-138, February.
    20. Liaw, Ching-Fang, 2000. "A hybrid genetic algorithm for the open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 124(1), pages 28-42, July.

    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:ejores:v:165:y:2005:i:2:p:314-328. 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/eor .

    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.