Minimizing Total Weighted Completion Time on Single Machine with Past-Sequence-Dependent Setup Times and Exponential Time-Dependent and Position-Dependent Learning Effects | Zendy

Kaibiao Sun | Zendy; Hongxiang Li | Zendy

Open Access

Minimizing Total Weighted Completion Time on Single Machine with Past-Sequence-Dependent Setup Times and Exponential Time-Dependent and Position-Dependent Learning Effects

Author(s) -

Kaibiao Sun,

Hongxiang Li

Publication year - 2009

Publication title -

discrete dynamics in nature and society

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.264

H-Index - 39

eISSN - 1607-887X

pISSN - 1026-0226

DOI - 10.1155/2009/970510

Subject(s) - exponential function , sequence (biology) , position (finance) , exponent , function (biology) , time sequence , computer science , exponential growth , time complexity , learning effect , mathematical optimization , algorithm , mathematics , mathematical analysis , linguistics , philosophy , genetics , finance , evolutionary biology , economics , biology , microeconomics

This paper addresses a single-machine problem in which the past-sequence-dependent (p-s-d) setup times and exponential time-dependent and position-dependent learning effects are considered. By the exponential time-dependent learning effect, it means that the processing time of a job is defined by an exponent function of the total actual processing time of the already processed jobs. The setup times are proportional to the length of the already processed jobs. The aim is to minimize the total weighted completion time, this is an NP-hard problem. Under certain conditions, it is shown that the classical WSPT rule is optimal for the problem

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research