An assignment problem with queueing time cost
From MaRDI portal
Publication:3496128
assignment problemheuristic solution proceduretotal expected costcustomersLagrangian relaxation methodservice facilitiesqueueing time
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Queues and service in operations research (90B22) Nonlinear programming (90C30) Queueing theory (aspects of probability theory) (60K25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)
Recommendations
- Solution procedures for the service system design problem
- Allocation of queuing facilities using a minimax criterion
- A note on the allocation of queuing facilities using a minisum criterion
- The design of service systems with queueing time cost, workload capacities and backup service
- A variation of the assignment problem
Cites work
Cited in
(9)- Model, analysis and application of employee assignment for quick service restaurant
- Location and capacity design of congested intermediate facilities in networks
- The multi-hour service system design problem
- Planning and coordination of production and distribution facilities for multiple commodities
- Assignment problems with changeover cost
- The design of service systems with queueing time cost, workload capacities and backup service
- Solution procedures for the service system design problem
- Fast heuristics for the time-constrained immobile server problem
- Priority Assignment in Waiting Line Problems
This page was built for publication: An assignment problem with queueing time cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496128)