Optimal online algorithms for scheduling on two identical machines under a grade of service   总被引：8，自引：0，他引：8  

蒋义伟  何勇  唐春梅 《浙江大学学报(A卷英文版)》2006,7(3):309-314

INTRODUCTIONWe study the problem of online scheduling on two identical parallel machines with a new feature that service requests from various customers are entitled to many different grade of service (GoS) levels. The goal is to minimize the makespan under the constraint that all requests are satisfied. This problem was first proposed by Hwang et al.(2004) and is motivated by the following scenario. In the service industry, the service providers often have special customers, such as, go…  相似文献