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

Operating theatre planning

Author

Listed:
  • Guinet, Alain
  • Chaabane, Sondes

Abstract

No abstract is available for this item.

Suggested Citation

  • Guinet, Alain & Chaabane, Sondes, 2003. "Operating theatre planning," International Journal of Production Economics, Elsevier, vol. 85(1), pages 69-81, July.
    • Handle: RePEc:eee:proeco:v:85:y:2003:i:1:p:69-81
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(03)00087-2
    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. Nicholas G. Hall & Chelliah Sriskandarajah, 1996. "A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process," Operations Research, INFORMS, vol. 44(3), pages 510-525, June.
    2. Sriskandarajah, C., 1993. "Performance of scheduling algorithms for no-wait flowshops with parallel machines," European Journal of Operational Research, Elsevier, vol. 70(3), pages 365-378, November.
    3. Wright, M. B., 1987. "The application of a surgical bed simulation model," European Journal of Operational Research, Elsevier, vol. 32(1), pages 26-32, October.
    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. Weiya Zhong & Yun Shi, 2018. "Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 108-125, January.
    2. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    3. Groflin, Heinz & Klinkert, Andreas, 2007. "Feasible insertions in job shop scheduling, short cycles and stable sets," European Journal of Operational Research, Elsevier, vol. 177(2), pages 763-785, March.
    4. Neil Geismar, H. & Dawande, Milind & Sriskandarajah, Chelliah, 2005. "Approximation algorithms for k-unit cyclic solutions in robotic cells," European Journal of Operational Research, Elsevier, vol. 162(2), pages 291-309, April.
    5. L Tang & H Xuan, 2006. "Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 316-324, March.
    6. Jung, Jung Woo & Lee, Young Hae, 2010. "Heuristic algorithms for production and transportation planning through synchronization of a serial supply chain," International Journal of Production Economics, Elsevier, vol. 124(2), pages 433-447, April.
    7. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
    8. Naderi, B. & Zandieh, M., 2014. "Modeling and scheduling no-wait open shop problems," International Journal of Production Economics, Elsevier, vol. 158(C), pages 256-266.
    9. Yuan, Jinjiang & Soukhal, Ameur & Chen, Youjun & Lu, Lingfa, 2007. "A note on the complexity of flow shop scheduling with transportation constraints," European Journal of Operational Research, Elsevier, vol. 178(3), pages 918-925, May.
    10. Marcin Mucha & Maxim Sviridenko, 2016. "No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 247-254, February.
    11. Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.
    12. Marco Pranzo & Dario Pacciarelli, 2016. "An iterated greedy metaheuristic for the blocking job shop scheduling problem," Journal of Heuristics, Springer, vol. 22(4), pages 587-611, August.
    13. Lin, Shih-Wei & Ying, Kuo-Ching, 2013. "Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm," Omega, Elsevier, vol. 41(2), pages 383-389.
    14. Lin, Shih-Wei & Ying, Kuo-Ching, 2016. "Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics," Omega, Elsevier, vol. 64(C), pages 115-125.
    15. Smutnicki, Czeslaw & Pempera, Jaroslaw & Bocewicz, Grzegorz & Banaszak, Zbigniew, 2022. "Cyclic flow-shop scheduling with no-wait constraints and missing operations," European Journal of Operational Research, Elsevier, vol. 302(1), pages 39-49.
    16. Ricardo Pérez-Rodríguez, 2024. "A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling Problem," Mathematics, MDPI, vol. 12(21), pages 1-15, October.
    17. Joaquín Bautista-Valhondo & Rocío Alfaro-Pozo, 2020. "Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types," 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. 28(1), pages 5-23, March.
    18. Matthias Bultmann & Sigrid Knust & Stefan Waldherr, 2018. "Flow shop scheduling with flexible processing times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 809-829, July.
    19. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    20. Allahverdi, Ali & Aydilek, Harun, 2014. "Total completion time with makespan constraint in no-wait flowshops with setup times," European Journal of Operational Research, Elsevier, vol. 238(3), pages 724-734.

    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:85:y:2003:i:1:p:69-81. 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.