Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects (Q1040180)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5637402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects |
scientific article; zbMATH DE number 5637402 |
Statements
Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects (English)
0 references
23 November 2009
0 references
Summary: 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.
0 references
0 references
0 references
0 references
0 references
0 references
0.9353781938552856
0 references
0.9081293940544128
0 references
0.8965796828269958
0 references
0.8874720335006714
0 references
