Improved bounds for online scheduling with eligibility constraints期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Improved bounds for online scheduling with eligibility constraints

Authors:	Kyungkuk LimKangbok Lee Soo Y. Chang

Affiliation:	^a Department of Industrial and Management Engineering, Pohang University of Science and Technology, San 31 Hyoja-Dong, Pohang, Kyungbuk, 790-784, Republic of Korea ^b Department of Supply Chain Management & Marketing Sciences, Rutgers Business School, 1 Washington Park, Newark, NJ 07102, USA

Abstract:

Keywords:	Online scheduling Parallel machines Eligibility constraints Greedy algorithm Competitive ratio
本文献已被 ScienceDirect 等数据库收录！