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

Scheduling multiprocessor tasks on parallel processors with limited availability

Author

Listed:
  • Blazewicz, Jacek
  • Dell'Olmo, Paolo
  • Drozdowski, Maciej
  • Maczka, Przemyslaw

Abstract

No abstract is available for this item.

Suggested Citation

  • Blazewicz, Jacek & Dell'Olmo, Paolo & Drozdowski, Maciej & Maczka, Przemyslaw, 2003. "Scheduling multiprocessor tasks on parallel processors with limited availability," European Journal of Operational Research, Elsevier, vol. 149(2), pages 377-389, September.
    • Handle: RePEc:eee:ejores:v:149:y:2003:i:2:p:377-389
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00760-9
    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. Blazwicz, Jacek & Liu, Zhen, 1996. "Scheduling multiprocessor tasks with chain constraints," European Journal of Operational Research, Elsevier, vol. 94(2), pages 231-241, October.
    2. Peter Brucker & Sigrid Knust & Duncan Roper & Yakov Zinder, 2000. "Scheduling UET task systems with concurrency on two parallel identical processors," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(3), pages 369-387, December.
    3. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    4. Drozdowski, Maciej, 1996. "Scheduling multiprocessor tasks -- An overview," European Journal of Operational Research, Elsevier, vol. 94(2), pages 215-230, October.
    5. Schmidt, Gunter, 2000. "Scheduling with limited machine availability," European Journal of Operational Research, Elsevier, vol. 121(1), pages 1-15, 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. Maciej Drozdowski & Florian Jaehn & Radosław Paszkowski, 2017. "Scheduling Position-Dependent Maintenance Operations," Operations Research, INFORMS, vol. 65(6), pages 1657-1677, December.
    2. Jaehn, Florian, 2024. "Scheduling with jobs at fixed positions," European Journal of Operational Research, Elsevier, vol. 318(2), pages 388-397.
    3. Levitin, Gregory & Xie, Min & Zhang, Tieling, 2007. "Reliability of fault-tolerant systems with parallel task processing," European Journal of Operational Research, Elsevier, vol. 177(1), pages 420-430, February.
    4. Liao, Lu-Wen & Sheen, Gwo-Ji, 2008. "Parallel machine scheduling with machine availability and eligibility constraints," European Journal of Operational Research, Elsevier, vol. 184(2), pages 458-467, January.
    5. Wu, Lingxiao & Wang, Shuaian, 2018. "Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks," International Journal of Production Economics, Elsevier, vol. 201(C), pages 26-40.
    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).

    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. Yumei Huo, 2019. "Parallel machine makespan minimization subject to machine availability and total completion time constraints," Journal of Scheduling, Springer, vol. 22(4), pages 433-447, August.
    2. Elisabeth Günther & Felix G. König & Nicole Megow, 2014. "Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 164-181, January.
    3. Blazewicz, Jacek & Liu, Zhen, 2002. "Linear and quadratic algorithms for scheduling chains and opposite chains," European Journal of Operational Research, Elsevier, vol. 137(2), pages 248-264, March.
    4. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    5. Huo, Yumei & Zhao, Hairong, 2015. "Total completion time minimization on multiple machines subject to machine availability and makespan constraints," European Journal of Operational Research, Elsevier, vol. 243(2), pages 547-554.
    6. Petchrompo, Sanyapong & Parlikad, Ajith Kumar, 2019. "A review of asset management literature on multi-asset systems," Reliability Engineering and System Safety, Elsevier, vol. 181(C), pages 181-201.
    7. Oguz, Ceyda & Zinder, Yakov & Ha Do, Van & Janiak, Adam & Lichtenstein, Maciej, 2004. "Hybrid flow-shop scheduling problems with multiprocessor task systems," European Journal of Operational Research, Elsevier, vol. 152(1), pages 115-131, January.
    8. Jürgen Strohhecker & Michael Hamann & Jörn-Henrik Thun, 2016. "Loading and sequencing heuristics for job scheduling on two unrelated parallel machines with long, sequence-dependent set-up times," International Journal of Production Research, Taylor & Francis Journals, vol. 54(22), pages 6747-6767, November.
    9. Liu Guiqing & Li Kai & Cheng Bayi, 2015. "Preemptive Scheduling with Controllable Processing Times on Parallel Machines," Journal of Systems Science and Information, De Gruyter, vol. 3(1), pages 68-76, February.
    10. Wang, Xiuli & Cheng, T.C.E., 2015. "A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint," International Journal of Production Economics, Elsevier, vol. 161(C), pages 74-82.
    11. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    12. Fatma-Zohra Baatout & Mhand Hifi, 2023. "A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors," Journal of Heuristics, Springer, vol. 29(2), pages 229-267, June.
    13. Hoogeveen, J. A. & Lenstra, J. K. & Veltman, B., 1996. "Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard," European Journal of Operational Research, Elsevier, vol. 89(1), pages 172-175, February.
    14. Yung-Chia Chang & Kuei-Hu Chang & Ching-Ping Zheng, 2022. "Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards," Mathematics, MDPI, vol. 10(13), pages 1-21, July.
    15. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    16. Hongying Li & Chunjie Su, 2011. "An optimal semi-online algorithm for 2-machine scheduling with an availability constraint," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 153-165, August.
    17. Leah Epstein, 2023. "Parallel solutions for preemptive makespan scheduling on two identical machines," Journal of Scheduling, Springer, vol. 26(1), pages 61-76, February.
    18. Han, Bin & Zhang, Wenjun & Lu, Xiwen & Lin, Yingzi, 2015. "On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost," European Journal of Operational Research, Elsevier, vol. 244(3), pages 704-714.
    19. Hnaien, Faicel & Yalaoui, Farouk & Mhadhbi, Ahmed, 2015. "Makespan minimization on a two-machine flowshop with an availability constraint on the first machine," International Journal of Production Economics, Elsevier, vol. 164(C), pages 95-104.
    20. Wu, Lingxiao & Wang, Shuaian, 2018. "Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks," International Journal of Production Economics, Elsevier, vol. 201(C), pages 26-40.

    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:149:y:2003:i:2:p:377-389. 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.