Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines

Authors:	Sven O. Krumke Alfred Taudes Stephan Westphal

Affiliation:	1. University of Kaiserslautern, Department of Mathematics, P.O. Box 3049, Paul-Ehrlich-Str. 14, 67653 Kaiserslautern, Germany;2. Vienna University of Economics and Business Administration, Institute for Production Management, Austria

Abstract:	We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-preemptive schedule which maximizes the total profit of the scheduled jobs. Let the common processing requirement of the jobs be p>0 $p > 0$ . For each job j_i, i=1,…,n we are given a release time r_i (at which the job becomes known) and a deadline _r_i+p+_δ_i $r_{i} + p + δ_{i}$ . If the job is scheduled and completed before the deadline, a profit of w_i is earned.

Keywords:	Revenue management Scheduling On-line algorithms Competitiveness
本文献已被 ScienceDirect 等数据库收录！