Allocation of tasks to specialized processors: A planning approach

DOI10.1016/S0377-2217(99)00282-9zbMath0970.90042OpenAlexW2120157007MaRDI QIDQ1584818

K. J. Becker, P. A. Jacobs, Siriphong Lawphongpanich, Kevin D. Glazebrook, D. P. jun. Gaver

Publication date: 5 November 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00282-9

zbMATH Keywords

optimizationqueueingservice systemjob allocation

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Discrete location and assignment (90B80)

Related Items (5)

Improving routing decisions in parallel non-observable queues ⋮ Assigning multiple job types to parallel specialized servers ⋮ Size- and state-aware dispatching problem with queue-specific job sizes ⋮ On the Value Function of the M/G/1 FCFS and LCFS Queues ⋮ DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM

Uses Software

• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Queueing System with General-Use and Limited-Use Servers
• Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
• The Bilingual Server System: A Queueing Model Featuring Fully And Partially Qualified Servers
• Optimal load balancing and scheduling in a distributed computer system
• Service-Adaptive Multitype Repairman Problems
• Scheduling with Random Arrivals and Linear Loss Functions

This page was built for publication: Allocation of tasks to specialized processors: A planning approach