Single-machine scheduling with accelerating learning effects (Q474156)
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 6372666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single-machine scheduling with accelerating learning effects |
scientific article; zbMATH DE number 6372666 |
Statements
Single-machine scheduling with accelerating learning effects (English)
0 references
24 November 2014
0 references
Summary: Scheduling with learning effects has been widely studied. However, there are situations where the learning effect might accelerate. In this paper, we propose a new model where the learning effect accelerates as time goes by. We derive the optimal solutions for the single-machine problems to minimize the makespan, total completion time, total weighted completion time, maximum lateness, maximum tardiness, and total tardiness.
0 references
0.8689286708831787
0 references
0.8688072562217712
0 references
0.8637619614601135
0 references
0.859606146812439
0 references
