文章基本信息

标题：On a generalized single machine scheduling problem with time-dependent processing times * * Supported by RFBR grants 13-01-12108, 15-07-07489, 15-07-03141 and DAAD grant A/1400328
本地全文：下载
作者：Alexander A. Lazarev ; Dmitry I. Arkhipov ; Frank Werner 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2016
卷号：49
期号：12
页码：226-230
DOI：10.1016/j.ifacol.2016.07.603
语种：English
出版社：Elsevier
摘要：In this paper, a generalized formulation of a classical single machine scheduling problem is considered. A set of n jobs characterized by their release dates, deadlines and a start time-dependent processing time function p(t) has to be processed on a single machine. The objective is to find a Pareto-optimal set of schedules with respect to the criteria ϕmax and makespan, where ϕmax is a non-decreasing function depending on the completion times of the jobs. We present an approach that allows to find an optimal schedule with respect to different scheduling criteria, such as the minimization of makespan, lateness or weighted lateness, tardiness and weighted tardiness etc. in time polynomially depending on the number of jobs. The complexity of the presented algorithm is O(n3 max{log n, H, P}), where H and P are the complexity of calculating ϕ j(t) and p(t), respectively.
关键词：scheduling algorithmssingle-machine schedulingpolynomial algorithmsmakespanPareto set