Single-machine batch scheduling problem with job rejection and resource dependent processing times
RAIRO-Oper. Res., 52 2 (2018) 315-334
Published online: 2018-05-31
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):
Minimizing the total weighted earliness-tardiness about a non-restrictive common due date with optional job rejection on single and multiple machines
Baruch Mor, Dana Shapira and Nir SonnComputational and Applied Mathematics 45 (5) (2026)
https://doi.org/10.1007/s40314-025-03586-0
A note: approximation algorithms for batch scheduling on shops with job rejection
Gur Mosheiov and Assaf SarigOperational Research 25 (2) (2025)
https://doi.org/10.1007/s12351-025-00921-5
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
Matan Atsmony and Gur MosheiovJournal of Scheduling 26 (2) 193 (2023)
https://doi.org/10.1007/s10951-022-00745-7
Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection
Baruch Mor and Gur MosheiovOperational Research 22 (3) 2707 (2022)
https://doi.org/10.1007/s12351-021-00627-4
Single machine scheduling with non-availability interval and optional job rejection
Baruch Mor and Dana ShapiraJournal of Combinatorial Optimization 44 (1) 480 (2022)
https://doi.org/10.1007/s10878-022-00845-2
Minimizing total late work on a single machine with generalized due-dates
Gur Mosheiov, Daniel Oron and Dvir ShabtayEuropean Journal of Operational Research 293 (3) 837 (2021)
https://doi.org/10.1016/j.ejor.2020.12.061