Minimizing the total weighted earliness and tardiness for a sequence of operations in job shops
RAIRO-Oper. Res., 56 4 (2022) 2621-2649
Published online: 2022-08-18
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Neighbourhood search-based metaheuristics for the bi-objective Pareto optimization of total weighted earliness-tardiness and makespan in a JIT single machine scheduling problem
Sona Babu and B.S. GirishOperations Research Perspectives 14 100335 (2025)
https://doi.org/10.1016/j.orp.2025.100335
Pareto-optimal front generation for the bi-objective JIT scheduling problems with a piecewise linear trade-off between objectives
Sona Babu and B.S. GirishOperations Research Perspectives 12 100299 (2024)
https://doi.org/10.1016/j.orp.2024.100299
Mathematical modeling and implementation of information and calculation tasks «MASKING»
Evgeniy Dmitriev, Andrei Tarakanov and Elena ShipilovaModeling of systems and processes 17 (2) 32 (2024)
https://doi.org/10.12737/2219-0767-2024-17-2-32-42
(2024)
https://doi.org/10.2139/ssrn.4879698
A hybrid genetic algorithm for stochastic job-shop scheduling problems
Mohammed Boukedroun, David Duvivier, Abdessamad Ait-el-Cadi, Vincent Poirriez and Moncef AbbasRAIRO - Operations Research 57 (4) 1617 (2023)
https://doi.org/10.1051/ro/2023067