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

Monge properties, discrete convexity and applications

Author

Listed:
  • Burkard, Rainer E.

Abstract

No abstract is available for this item.

Suggested Citation

  • Burkard, Rainer E., 2007. "Monge properties, discrete convexity and applications," European Journal of Operational Research, Elsevier, vol. 176(1), pages 1-14, January.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:1:p:1-14
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00870-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. P. C. Gilmore & R. E. Gomory, 1964. "Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem," Operations Research, INFORMS, vol. 12(5), pages 655-679, October.
    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. He, Cheng & Lin, Yixun & Yuan, Jinjiang, 2010. "A note on the single machine scheduling to minimize the number of tardy jobs with deadlines," European Journal of Operational Research, Elsevier, vol. 201(3), pages 966-970, March.
    2. Hildebrandt, Benjamin & Hurink, Johann & Manitz, Michael, 2024. "Local energy management: A base model for the optimization of virtual economic units," Energy Economics, Elsevier, vol. 129(C).
    3. Akamatsu, Takashi & Wada, Kentaro & Iryo, Takamasa & Hayashi, Shunsuke, 2021. "A new look at departure time choice equilibrium models with heterogeneous users," Transportation Research Part B: Methodological, Elsevier, vol. 148(C), pages 152-182.
    4. Tseytlin, Yulia & Heese, H. Sebastian, 2023. "Inventory allocation with full downward substitution and monotone cost differences," European Journal of Operational Research, Elsevier, vol. 307(1), pages 130-139.
    5. Máté Hireš & Monika Molnárová & Peter Drotár, 2020. "Robustness of Interval Monge Matrices in Fuzzy Algebra," Mathematics, MDPI, vol. 8(4), pages 1-16, April.
    6. Qi Feng & Chengzhang Li & Mengshi Lu & Jeyaveerasingam George Shanthikumar, 2022. "Dynamic Substitution for Selling Multiple Products under Supply and Demand Uncertainties," Production and Operations Management, Production and Operations Management Society, vol. 31(4), pages 1645-1662, April.
    7. Osawa, Minoru & Fu, Haoran & Akamatsu, Takashi, 2018. "First-best dynamic assignment of commuters with endogenous heterogeneities in a corridor network," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 811-831.
    8. F. Javier Martinez de Albeniz & Carles Rafels, 2012. "Monge assignment games," Working Papers in Economics 282, Universitat de Barcelona. Espai de Recerca en Economia.
    9. Alexander S. Estes & Michael O. Ball, 2021. "Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 785-807, May.
    10. Akamatsu, Takashi & Wada, Kentaro & Iryo, Takamasa & Hayashi, Shunsuke, 2018. "Departure time choice equilibrium and optimal transport problems," MPRA Paper 90361, University Library of Munich, Germany.
    11. Tseytlin, Yulia & Heese, H. Sebastian, 2019. "Allocation under a general substitution structure," European Journal of Operational Research, Elsevier, vol. 277(2), pages 492-506.

    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. Waldherr, Stefan & Knust, Sigrid, 2017. "Decomposition algorithms for synchronous flow shop problems with additional resources and setup times," European Journal of Operational Research, Elsevier, vol. 259(3), pages 847-863.
    2. 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.
    3. 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.
    4. 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.
    5. Panwalkar, S.S. & Koulamas, Christos, 2014. "The two-machine no-wait general and proportionate open shop makespan problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 471-475.
    6. 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.
    7. Batur, G. Didem & Karasan, Oya Ekin & Akturk, M. Selim, 2012. "Multiple part-type scheduling in flexible robotic cells," International Journal of Production Economics, Elsevier, vol. 135(2), pages 726-740.
    8. Delorme, Xavier & Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y., 2019. "Minimizing the number of workers in a paced mixed-model assembly line," European Journal of Operational Research, Elsevier, vol. 272(1), pages 188-194.
    9. Kravchenko, Svetlana A., 1998. "A polynomial algorithm for a two-machine no-wait job-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 106(1), pages 101-107, April.
    10. Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2020. "Coupled task scheduling with exact delays: Literature review and models," European Journal of Operational Research, Elsevier, vol. 282(1), pages 19-39.
    11. Kalczynski, Pawel J. & Kamburowski, Jerzy, 2009. "An empirical analysis of the optimality rate of flow shop heuristics," European Journal of Operational Research, Elsevier, vol. 198(1), pages 93-101, October.
    12. Martinez, S. & Dauzere-Peres, S. & Gueret, C. & Mati, Y. & Sauer, N., 2006. "Complexity of flowshop scheduling problems with a new blocking constraint," European Journal of Operational Research, Elsevier, vol. 169(3), pages 855-864, March.
    13. A.J. Scott, 1969. "Combinatorial Programming and the Planning of Urban and Regional Systems," Environment and Planning A, , vol. 1(2), pages 125-142, December.
    14. Çela, Eranda & Deineko, Vladimir & Woeginger, Gerhard J., 2012. "The x-and-y-axes travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 333-345.
    15. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    16. Grabowski, Jozef & Pempera, Jaroslaw, 2000. "Sequencing of jobs in some production system," European Journal of Operational Research, Elsevier, vol. 125(3), pages 535-550, September.
    17. Pranzo, Marco, 2004. "Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times," European Journal of Operational Research, Elsevier, vol. 153(3), pages 581-592, March.
    18. Chauhan, Satyaveer S. & Gordon, Valery & Proth, Jean-Marie, 2007. "Scheduling in supply chain environment," European Journal of Operational Research, Elsevier, vol. 183(3), pages 961-970, December.
    19. Carlier, Jacques & Haouari, Mohamed & Kharbeche, Mohamed & Moukrim, Aziz, 2010. "An optimization-based heuristic for the robotic cell problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 636-645, May.
    20. Agnetis, A., 2000. "Scheduling no-wait robotic cells with two and three machines," European Journal of Operational Research, Elsevier, vol. 123(2), pages 303-314, June.

    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:176:y:2007:i:1:p:1-14. 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.