Search Results - "greedy randomized algorithm"

  • Showing 1 - 8 results of 8
Refine Results
  1. 1
    Cover Image

    A Service System with Packing Constraints: Greedy Randomized Algorithm Achieving Sublinear in Scale Optimality Gap by Stolyar, Alexander L., Zhong, Yuan

    ISSN: 1946-5238, 1946-5238
    Published: 01.06.2021
    Published in Stochastic systems (01.06.2021)
    “… Multiple customers can be placed for simultaneous service into one server, subject to general packing constraints…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints by Stolyar, Alexander L., Zhong, Yuan

    ISSN: 0257-0130, 1572-9443
    Published: Boston Springer US 01.02.2015
    Published in Queueing systems (01.02.2015)
    “… There is an infinite number of servers. Multiple customers can be placed for service into one server, subject to general “packing” constraints…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

    A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing model by Stolyar, Alexander L., Yuan Zhong

    Published: IEEE 01.09.2016
    “…We consider an infinite-server system, where multiple customers can be placed into one server for service simultaneously, subject to packing constraints…”
    Get full text
    Conference Proceeding
    Save to List
    Saved in:
  4. 4
    Cover Image

    A service system with packing constraints: Greedy randomized algorithm achieving sublinear in scale optimality gap by Stolyar, Alexander, Zhong, Yuan

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 19.11.2020
    Published in arXiv.org (19.11.2020)
    “… Multiple customers can be placed for simultaneous service into one server, subject to general packing constraints…”
    Get full text
    Paper
    Save to List
    Saved in:
  5. 5
    Cover Image

    An infinite server system with general packing constraints: Asymptotic optimality of a greedy randomized algorithm by Stolyar, Alexander L., Yuan Zhong

    Published: IEEE 2013
    “… Multiple customers can be placed into one server for service, subject to general "packing" constraints…”
    Get full text
    Conference Proceeding
    Save to List
    Saved in:
  6. 6
    Cover Image

    Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints by Stolyar, Alexander, Zhong, Yuan

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 22.05.2014
    Published in arXiv.org (22.05.2014)
    “… There is an infinite number of servers. Multiple customers can be placed for service into one server, subject to general "packing" constraints…”
    Get full text
    Paper
    Save to List
    Saved in:
  7. 7
    Cover Image

    Distribution requirements and compactness constraints in school timetabling by Drexl, Andreas, Salewski, Frank

    ISSN: 0377-2217, 1872-6860
    Published: Amsterdam Elsevier B.V 01.10.1997
    Published in European journal of operational research (01.10.1997)
    “… Among these constraints are: No class, subject, room, and teacher overlaps; class, subject, room, and teacher unavailabilities…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  8. 8
    Cover Image

    Scheduling wagons to unload in bulk cargo ports with uncertain processing times by Ferreira, Cristiane, Figueira, Gonçalo, Amorim, Pedro, Pigatti, Alexandre

    ISSN: 0305-0548
    Published: Elsevier Ltd 01.12.2023
    Published in Computers & operations research (01.12.2023)
    “… For the deterministic problem, we compare three solution approaches: a Mixed Integer Programming model, a Constraint Programming model and a Greedy Randomised algorithm…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: