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

Review of properties of different precedence graphs for scheduling problems

Author

Listed:
  • Blazewicz, Jacek
  • Kobler, Daniel

Abstract

No abstract is available for this item.

Suggested Citation

  • Blazewicz, Jacek & Kobler, Daniel, 2002. "Review of properties of different precedence graphs for scheduling problems," European Journal of Operational Research, Elsevier, vol. 142(3), pages 435-443, November.
    • Handle: RePEc:eee:ejores:v:142:y:2002:i:3:p:435-443
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(01)00379-4
    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. F. Brian Talbot & James H. Patterson, 1978. "An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems," Management Science, INFORMS, vol. 24(11), pages 1163-1174, July.
    2. Peter C. Fishburn, 1970. "Intransitive Indifference in Preference Theory: A Survey," Operations Research, INFORMS, vol. 18(2), pages 207-228, April.
    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. Agnetis, Alessandro & Kellerer, Hans & Nicosia, Gaia & Pacifici, Andrea, 2012. "Parallel dedicated machines scheduling with chain precedence constraints," European Journal of Operational Research, Elsevier, vol. 221(2), pages 296-305.
    2. Gaia Nicosia & Andrea Pacifici, 2017. "Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1680-1691, March.

    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. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
    2. Marc Le Menestrel & Luk Van Wassenhove, 2001. "The Domain and Interpretation of Utility Functions: An Exploration," Theory and Decision, Springer, vol. 51(2), pages 329-349, December.
    3. Barberà, Salvador & Bossert, Walter & Moreno-Ternero, Juan D., 2023. "Wine rankings and the Borda method," Journal of Wine Economics, Cambridge University Press, vol. 18(2), pages 122-138, May.
    4. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Colin E. Bell & Jaemin Han, 1991. "A new heuristic solution method in resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 315-331, June.
    6. Aristide Mingozzi & Vittorio Maniezzo & Salvatore Ricciardelli & Lucio Bianco, 1998. "An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation," Management Science, INFORMS, vol. 44(5), pages 714-729, May.
    7. Gilboa, Itzhak & Lapson, Robert, 1995. "Aggregation of Semiorders: Intransitive Indifference Makes a Difference," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 5(1), pages 109-126, January.
    8. M. Ali Khan & Metin Uyanık, 2021. "Topological connectedness and behavioral assumptions on preferences: a two-way relationship," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 71(2), pages 411-460, March.
    9. Arno Sprecher, 2000. "Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements," Management Science, INFORMS, vol. 46(5), pages 710-723, May.
    10. Kai Watermeyer & Jürgen Zimmermann, 2022. "A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 575-602, June.
    11. Kolisch, Rainer, 1994. "Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 344, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Kai Watermeyer & Jürgen Zimmermann, 2020. "A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 427-460, June.
    13. Simpson, Wendell P. & Patterson, James H., 1996. "A multiple-tree search procedure for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 525-542, March.
    14. Kaushik Basu, 2007. "Coercion, contract and the limits of the market," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(4), pages 559-579, December.
    15. Frank Schultmann & Otto Rentz, 2002. "Scheduling of deconstruction projects under resource constraints," Construction Management and Economics, Taylor & Francis Journals, vol. 20(5), pages 391-401.
    16. Elias Bouacida, 2021. "Identifying Choice Correspondences," Working Papers 327800275, Lancaster University Management School, Economics Department.
    17. Sprecher, Arno, 1996. "Solving the RCPSP efficiently at modest memory requirements," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 425, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Ulrich Dorndorf & Erwin Pesch & Toàn Phan-Huy, 2000. "A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints," Management Science, INFORMS, vol. 46(10), pages 1365-1384, October.
    19. Hartmann, Sönke & Drexl, Andreas, 1997. "Project scheduling with multiple modes: A comparison of exact algorithms," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 430, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Klein, Robert & Scholl, Armin, 1999. "Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 112(2), pages 322-346, January.

    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:142:y:2002:i:3:p:435-443. 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.