Skip to content
About
Overview
Organization
LARSyS
People
Contacts
Research
Groups
Projects
Publications
R&D Infrastructures
Opportunities
Education
Study@Técnico
Doctoral Programs
Scholarships
Society
Alumni
Startups
Outreach
Awards
Success Stories
Media
Highlights
Press
Newsletter
Gallery
About
Overview
Organization
LARSyS
People
Contacts
Research
Groups
Projects
Publications
R&D Infrastructures
Opportunities
Education
Study@Técnico
Doctoral Programs
Scholarships
Society
Alumni
Startups
Outreach
Awards
Success Stories
Media
Highlights
Press
Newsletter
Gallery
Search
Conference Papers
Single Server Scheduling Problem. Optimal policy for convex costs depends on arrival rates
Carlos Bispo
Intelligent Robots and Systems Group (IRSg)
Proc. of MISTA 2011 - 5th Multidisciplinary International Scheduling Conference, Phoenix, USA
January, 2011