The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects

This paper addresses the optimization of a single machine scheduling problem with additional constraints which are sequence-independent setup times and time-dependent learning and forgetting effects. The considered objective function is to minimize the maximum completion time (makespan). We define a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization letters Ročník 15; číslo 4; s. 1327 - 1343
Hlavní autoři: Muştu, Settar, Eren, Tamer
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2021
Témata:
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Setup time
Pseudo polynomial time algorithm
Learning effect
Forgetting effect
Complexity
ISSN:1862-4472, 1862-4480
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper addresses the optimization of a single machine scheduling problem with additional constraints which are sequence-independent setup times and time-dependent learning and forgetting effects. The considered objective function is to minimize the maximum completion time (makespan). We define a bivariate general learning and forgetting model consisting of two independent variables which are the sum of normal processing times of previous jobs in the schedule and the setup time of the present job. We demonstrate some global properties of an optimal schedule and prove that the problem is ordinary NP-hard by means of a polynomial transformation from a known decision problem to the decision version of the considered problem. Furthermore, we propose an integer non-linear programming model and a dynamic programming model which can be executed in pseudo-polynomial time.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-020-01641-9