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

Podrobná bibliografia

Vydané v:	Optimization letters Ročník 15; číslo 4; s. 1327 - 1343
Hlavní autori:	Muştu, Settar, Eren, Tamer
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2021
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!