Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times

This paper studies the single machine scheduling problems with truncated logarithm processing times and exponential past-sequence-dependent delivery times. We prove that the makespan and total completion time minimizations are polynomially solvable. For the total weighted completion time minimizatio...

Full description

Saved in:
Bibliographic Details
Published in:Computational & applied mathematics 2024-06, Vol.43 (4), Article 194
Main Authors: Wang, Xiao-Yuan, Lv, Dan-Yang, Ji, Ping, Yin, Na, Wang, Ji-Bo, Qian, Jin
Format: Article
Language:English
Subjects:
Applications of Mathematics
Completion time
Computational Mathematics and Numerical Analysis
Heuristic methods
Mathematical Applications in Computer Science
Mathematical Applications in the Physical Sciences
Mathematics
Mathematics and Statistics
Scheduling
Search algorithms
Tabu search
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies the single machine scheduling problems with truncated logarithm processing times and exponential past-sequence-dependent delivery times. We prove that the makespan and total completion time minimizations are polynomially solvable. For the total weighted completion time minimization, we illustrate that it remains polynomially solvable under a special case; under the general case, this paper proposes heuristic, tabu search and branch-and-bound algorithms. Computational experiments indicate that the heuristic algorithm is more effective than tabu search algorithm.
ISSN:2238-3603
1807-0302
DOI:10.1007/s40314-024-02717-3