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

A capacity allocation problem with integer side constraints

Author

Listed:
  • Toktay, L. Beril
  • Uzsoy, Reha

Abstract

No abstract is available for this item.

Suggested Citation

  • Toktay, L. Beril & Uzsoy, Reha, 1998. "A capacity allocation problem with integer side constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 170-182, August.
    • Handle: RePEc:eee:ejores:v:109:y:1998:i:1:p:170-182
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)80011-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. Graves, Stephen C., 1983. "Scheduling of re-entrant flow shops," Working papers 1438-83., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Aboudi, Ronny & Hallefjord, Asa & Jornsten, Kurt, 1991. "A facet generation and relaxation technique applied to an assignment problem with side constraints," European Journal of Operational Research, Elsevier, vol. 50(3), pages 335-344, 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. S Bilgin & M Azizoǧlu, 2006. "Capacity and tool allocation problem in flexible manufacturing systems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 670-681, June.
    2. Elif Akçalı & Alper Üngör & Reha Uzsoy, 2005. "Short‐term capacity allocation problem with tool and setup constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 754-764, December.
    3. S Özpeynirci & M Azizoğlu, 2010. "A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 872-877, May.

    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. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
    2. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
    3. Foad Iravani & Sriram Dasu & Reza Ahmadi, 2012. "A Hierarchical Framework for Organizing a Software Development Process," Operations Research, INFORMS, vol. 60(6), pages 1310-1322, December.
    4. Sox, Charles R. & Jackson, Peter L. & Bowman, Alan & Muckstadt, John A., 1999. "A review of the stochastic lot scheduling problem," International Journal of Production Economics, Elsevier, vol. 62(3), pages 181-200, September.
    5. Nazim Sami & Karim Amrouche & Mourad Boudhar, 2024. "New efficient algorithms for the two-machine no-wait chain-reentrant shop problem," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-29, July.
    6. Yura, Kenji, 1999. "Cyclic scheduling for re-entrant manufacturing systems," International Journal of Production Economics, Elsevier, vol. 60(1), pages 523-528, April.
    7. Gaby Pinto & Yariv Ben-Dov & Gad Rabinowitz, 2013. "Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)," Annals of Operations Research, Springer, vol. 206(1), pages 311-339, July.
    8. Maedeh Fasihi & Reza Tavakkoli-Moghaddam & Fariborz Jolai, 2023. "A bi-objective re-entrant permutation flow shop scheduling problem: minimizing the makespan and maximum tardiness," Operational Research, Springer, vol. 23(2), pages 1-41, June.
    9. Riezebos, J. & Gaalman, G. J. C., 1998. "Time lag size in multiple operations flow shop scheduling heuristics," European Journal of Operational Research, Elsevier, vol. 105(1), pages 72-90, February.
    10. Dugardin, Frédéric & Yalaoui, Farouk & Amodeo, Lionel, 2010. "New multi-objective method to solve reentrant hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 22-31, May.
    11. Roemer, Thomas A. & Ahmadi, Reza, 2010. "Models for concurrent product and process design," European Journal of Operational Research, Elsevier, vol. 203(3), pages 601-613, June.
    12. Lei Liu & Marcello Urgo, 2024. "Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type dis," Annals of Operations Research, Springer, vol. 338(1), pages 741-764, July.
    13. Yu, Tae-Sun & Pinedo, Michael, 2020. "Flow shops with reentry: Reversibility properties and makespan optimal schedules," European Journal of Operational Research, Elsevier, vol. 282(2), pages 478-490.
    14. Choi, Seong-Woo & Kim, Yeong-Dae, 2009. "Minimizing total tardiness on a two-machine re-entrant flowshop," European Journal of Operational Research, Elsevier, vol. 199(2), pages 375-384, December.
    15. Lotte Berghman & Roel Leus & Frits Spieksma, 2014. "Optimal solutions for a dock assignment problem with trailer transportation," Annals of Operations Research, Springer, vol. 213(1), pages 3-25, February.
    16. Guignard, Monique, 1998. "Efficient cuts in Lagrangean `Relax-and-cut' schemes," European Journal of Operational Research, Elsevier, vol. 105(1), pages 216-223, February.
    17. S-W Choi & Y-D Kim, 2007. "Minimizing makespan on a two-machine re-entrant flowshop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(7), pages 972-981, July.
    18. Jérémie Gallien & Stephen C. Graves & Alan Scheller-Wolf, 2016. "OM Forum—Practice-Based Research in Operations Management: What It Is, Why Do It, Related Challenges, and How to Overcome Them," Manufacturing & Service Operations Management, INFORMS, vol. 18(1), pages 5-14, February.
    19. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    20. Felici, Giovanni & Mecoli, Mariagrazia, 2007. "Resource assignment with preference conditions," European Journal of Operational Research, Elsevier, vol. 180(2), pages 519-531, 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:109:y:1998:i:1:p:170-182. 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.