An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system (Q3553742): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064179952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of value functions for threshold policies in queueing models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time queues in heavy traffic with earliest-deadline-first queue discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and analysis of uncertain time-critical tasking problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stochastic scheduling problems with due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal allocation of service to impatient tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic policies for uncertain time‐critical tasking problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outsourcing warranty repairs: Dynamic allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATE DYNAMIC PROGRAMMING TECHNIQUES FOR THE CONTROL OF TIME-VARYING QUEUING SYSTEMS APPLIED TO CALL CENTERS WITH ABANDONMENTS AND RETRIALS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules / rank
 
Normal rank

Latest revision as of 17:43, 2 July 2024

scientific article
Language Label Description Also known as
English
An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
scientific article

    Statements

    An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system (English)
    0 references
    0 references
    21 April 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    fluid models
    0 references
    0 references
    0 references
    0 references