Open AccessScheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
Author(s) -
JiBo Wang,
Mengqi Liu,
Na Yin,
Ping Ji
Publication year - 2017
Publication title -
journal of industrial and management optimization
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.325
H-Index - 32
eISSN - 1553-166X
pISSN - 1547-5816
DOI - 10.3934/jimo.2016060
Subject(s) - learning effect , job shop scheduling , computer science , time complexity , mathematical optimization , scheduling (production processes) , single machine scheduling , convex function , function (biology) , regular polygon , resource allocation , algorithm , mathematics , microeconomics , economics , schedule , computer network , geometry , evolutionary biology , biology , operating system
In this paper, we consider single machine scheduling problems with controllable processing time (resource allocation), truncated job-dependent learning and deterioration effects. The goal is to fnd the optimal sequence of jobs and the optimal resource allocation separately for minimizing a cost function containing makespan (total completion time, total absolute differences in completion times) and/or total resource cost. For two di?erent processing time functions, i.e., a linear and a convex function of the amount of a common continuously divisible resource allocated to the job, we solve them in polynomial time respectively.Department of Industrial and Systems Engineering2016-2017 > Academic research: refereed > Publication in refereed journalbcr