The Online Specialization Problem
We study the online specialization problem, where items arrive in an online fashion for processing by one of n different methods. Each method has two costs: a processing cost (paid once for each item processed), and a set-up cost (paid only once, on the method's first use). There are n p...
Main Author: | Ed Hong |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2006-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/492 |
Similar Items
-
Being-online-in-the-world: A response to the special issue, ‘Being Online’
by: Christopher Howard
Published: (2015-08-01) -
“Being Online” Special Issue - Editors’ Introduction
by: Norm Friesen, et al.
Published: (2014-06-01) -
ONLINE Special: Article Courage, heart and brain
by: Carole Beals, et al.
Published: (2008-04-01) -
Special interest communities : Design for online growth
by: Röning, Nadia
Published: (2017) -
The Online Reservation Problem
by: Shashank Goyal, et al.
Published: (2020-09-01)