Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
International Journal of Applied Mathematics and Computer Science
Volume 34 (2024): Issue 2 (June 2024)
Open Access
New Ideas in Lagrangian Relaxation for a Scheduling Problem with the weighted Tardiness Criterion
Jarosław Rudy
Jarosław Rudy
,
Radosław Idzikowski
Radosław Idzikowski
,
Czesław Smutnicki
Czesław Smutnicki
,
Zbigniew Banaszak
Zbigniew Banaszak
and
Grzegorz Bocewicz
Grzegorz Bocewicz
| Jun 25, 2024
International Journal of Applied Mathematics and Computer Science
Volume 34 (2024): Issue 2 (June 2024)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Jun 25, 2024
Page range:
235 - 251
Received:
Oct 17, 2023
Accepted:
Mar 18, 2024
DOI:
https://doi.org/10.61822/amcs-2024-0017
Keywords
Lagrangian relaxation
,
scheduling
,
total weighted tardiness
,
metaheuristics
© 2024 Jarosław Rudy et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.