IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v46y1999i8p893-911.html
   My bibliography  Save this article

Minimizing makespan in a multimode multiprocessor shop scheduling problem

Author

Listed:
  • Lucio Bianco
  • Paolo Dell'Olmo
  • Stefano Giordani
  • Maria Grazia Speranza

Abstract

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is NP‐hard in several particular cases. In previous works, we studied algorithms in which a solution was obtained by means of an iterative procedure that combines mode assignment and sequencing phases separately. In this paper, we present some new heuristics where the decision on the mode assignment is taken on the basis of a partial schedule. Then, for each task, the mode selection and the starting time are chosen simultaneously considering the current processor usage. Different lower bounds are derived from a mathematical formulation of the problem and from a graph representation of a particular relaxed version of the problem. Heuristic solutions and lower bounds are evaluated on randomly generated test problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 893–911, 1999

Suggested Citation

  • Lucio Bianco & Paolo Dell'Olmo & Stefano Giordani & Maria Grazia Speranza, 1999. "Minimizing makespan in a multimode multiprocessor shop scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(8), pages 893-911, December.
    • Handle: RePEc:wly:navres:v:46:y:1999:i:8:p:893-911
    DOI: 10.1002/(SICI)1520-6750(199912)46:83.0.CO;2-7
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199912)46:83.0.CO;2-7
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199912)46:83.0.CO;2-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Bianco, L. & Dell'Olmo, P. & Grazia Speranza, M., 1998. "Heuristics for multimode scheduling problems with dedicated resources," European Journal of Operational Research, Elsevier, vol. 107(2), pages 260-271, June.
    2. Andreas Drexl, 1991. "Scheduling of Project Networks by Job Assignment," Management Science, INFORMS, vol. 37(12), pages 1590-1602, December.
    3. L. Bianco & P. Dell'Olmo & M. Grazia Speranza, 1994. "Nonpreemptive scheduling of independent tasks with prespecified processor allocations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(7), pages 959-971, December.
    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. Ferreira, Cristiane & Figueira, Gonçalo & Amorim, Pedro, 2021. "Scheduling Human-Robot Teams in collaborative working cells," International Journal of Production Economics, Elsevier, vol. 235(C).

    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. George L. Vairaktarakis, 2003. "The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem," Management Science, INFORMS, vol. 49(6), pages 718-732, June.
    3. Kimms, A., 1996. "Multi-level, single-machine lot sizing and scheduling (with initial inventory)," European Journal of Operational Research, Elsevier, vol. 89(1), pages 86-99, February.
    4. Salewski, Frank & Schirmer, Andreas & Drexl, Andreas, 1996. "Project Scheduling under Resource and Mode Identity Constraints. Part II: An Application to Audit-Staff Scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 388, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Gonçalves, J.F. & Mendes, J.J.M. & Resende, M.G.C., 2008. "A genetic algorithm for the resource constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1171-1190, September.
    6. Ferreira, Cristiane & Figueira, Gonçalo & Amorim, Pedro, 2021. "Scheduling Human-Robot Teams in collaborative working cells," International Journal of Production Economics, Elsevier, vol. 235(C).
    7. 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.
    8. 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.
    9. Bartsch, Thomas & Kröger, Stefan, 1996. "Ein Entscheidungs-Unterstützungs-System zur Erstellung von Spielplänen für die Fußballbundesliga," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 427, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Drexl, Andreas & Salewski, Frank, 1996. "Distribution Requirements and Compactness Constraints in School Timetabling. Part II: Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 384, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Hans, Erwin & Wullink, Gerhard & van Houdenhoven, Mark & Kazemier, Geert, 2008. "Robust surgery loading," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1038-1050, March.
    12. Nadia Chaudry & Ingunn Vermedal & Kjetil Fagerholt & Maria Fleischer Fauske & Magnus Stålhane, 2020. "A decomposition solution approach to the troops-to-tasks assignment in military peacekeeping operations," The Journal of Defense Modeling and Simulation, , vol. 17(4), pages 357-371, October.
    13. Böttcher, Jan & Drexl, Andreas & Kolisch, Rainer & Salewski, Frank, 1996. "Project scheduling under partially renewable resource constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 398, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Rahman Torba & Stéphane Dauzère-Pérès & Claude Yugma & Cédric Gallais & Juliette Pouzet, 2024. "Solving a real-life multi-skill resource-constrained multi-project scheduling problem," Annals of Operations Research, Springer, vol. 338(1), pages 69-114, July.
    15. Buddhakulsomsiri, Jirachai & Kim, David S., 2007. "Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting," European Journal of Operational Research, Elsevier, vol. 178(2), pages 374-390, April.
    16. Schirmer, Andreas, 1998. "Case-based reasoning and improved adaptive search for project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 472, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. Sprecher, Arno & Drexl, Andreas, 1998. "Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm," European Journal of Operational Research, Elsevier, vol. 107(2), pages 431-450, June.
    18. Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2005. "Justification and RCPSP: A technique that pays," European Journal of Operational Research, Elsevier, vol. 165(2), pages 375-386, September.
    19. Salewski, Frank & Schirmer, Andreas & Drexl, Andreas, 1996. "Project Scheduling under Resource and Mode Identity Constraints. Part I: Model, Complexity Status, and Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 387, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Drexl, Andreas & Frahm, Johannes & Salewski, Frank, 1997. "Audit-staff scheduling by column generation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 464, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:wly:navres:v:46:y:1999:i:8:p:893-911. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.