A Simple Algorithm for Scheduling Jobs with GoS Levels
Available Online April 2017.
- https://doi.org/10.2991/fmsmt-17.2017.92How to use a DOI?
- Scheduling, Grade of Service, Makespan, Worst-case Analysis.
- The problem of scheduling jobs with grade of service (GoS) levels is considered, which is motivated from an application in service industry. Jobs and machines are labeled with GoS levels. If the GoS level of a job is greater than or equal to the GoS level of a machine, then this job can be processed on this machine. The objective is to minimize makespan. A simple and fast 3/2-approximation algorithm is presented.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Xin Xiao PY - 2017/04 DA - 2017/04 TI - A Simple Algorithm for Scheduling Jobs with GoS Levels BT - Proceedings of the 2017 5th International Conference on Frontiers of Manufacturing Science and Measuring Technology (FMSMT 2017) PB - Atlantis Press SP - 435 EP - 439 SN - 2352-5401 UR - https://doi.org/10.2991/fmsmt-17.2017.92 DO - https://doi.org/10.2991/fmsmt-17.2017.92 ID - Xiao2017/04 ER -