A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
RAIRO-Oper. Res., 50 1 (2016) 211-219
Published online: 2016-02-02
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):
Minimization of maximum lateness in a flowshop learning effect scheduling with release dates
Danyu Bai, Xiaoyuan Bai, Jie Yang, et al.Computers & Industrial Engineering 158 107309 (2021)
https://doi.org/10.1016/j.cie.2021.107309
Minimizing the total weighted tardiness of overlapping jobs on parallel machines with a learning effect
Jen-Ya WangJournal of the Operational Research Society 71 (6) 910 (2020)
https://doi.org/10.1080/01605682.2019.1590511
Single-machine lot scheduling problem for deteriorating items with negative exponential deterioration rate
Amir Hossein Nobil, Abolfazl Kazemi and Ata Allah TaleizadehRAIRO - Operations Research 53 (4) 1297 (2019)
https://doi.org/10.1051/ro/2018037