Article references

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:

Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines

Imed Kacem, Myriam Sahnoune, Günter Schmidt

RAIRO-Oper. Res., 51 4 (2017) 1177-1188

Published online: 2017-11-24

DOI: https://doi.org/10.1051/ro/2017044

This article has been cited by the following article(s):

Trimming-the-state-space mechanism embedded branch-and-bound algorithm for two-parallel machines scheduling with availability constraints

Anh H.G. Nguyen and Gwo-Ji Sheen
Computers & Industrial Engineering 190 110002 (2024)
https://doi.org/10.1016/j.cie.2024.110002

Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan

Gais Alhadi, Imed Kacem, Pierre Laroche and Izzeldin M. Osman
RAIRO - Operations Research 58 (3) 2393 (2024)
https://doi.org/10.1051/ro/2024029

A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint

Mengzhuo Bai and Yufang Zhao
Engineering Optimization 52 (8) 1313 (2020)
https://doi.org/10.1080/0305215X.2019.1650922

Two-machine flow shop with synchronized periodic maintenance

Issam Krimi, Rachid Benmansour, Saïd Hanafi and Nizar Elhachemi
RAIRO - Operations Research 53 (1) 351 (2019)
https://doi.org/10.1051/ro/2018062

Computational Logistics

Imed Kacem and Hans Kellerer
Lecture Notes in Computer Science, Computational Logistics 11184 417 (2018)
https://doi.org/10.1007/978-3-030-00898-7_28