Cite

[1] Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, L. Stougie, “Multiprocessor scheduling with rejection”, Journal of Discrete Mathematics 13(1), 64–78, (2000).10.1137/S0895480196300522Search in Google Scholar

[2] J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt, J. Weglarz, “Handbook on scheduling : From theory to applications”, Springer Berlin Heidelberg New York (2007).Search in Google Scholar

[3] K. Deb, S. S. Agrawal, A. Pratap, T. Meyarivan, “A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II”, Lecture Notes in Computer Sciences, 1917, 849–858, (2000).10.1007/3-540-45356-3_83Search in Google Scholar

[4] F. Dugardin, F. Yalaoui, L. Amodeo “New multi-objective method to solve reentrant hybrid flow shop scheduling problem”, European Journal of Operational Research 203(1), 22–31, (2010).10.1016/j.ejor.2009.06.031Search in Google Scholar

[5] Z.-H. Jia, M.-L. Pei, J.Y.-T. Leung “Multi-objective ACO algorithms to minimize the makespan and the total rejection cost on BPMs with arbitrary job weights”, International Journal of Systems Science 48 (16), 3542–3557, (2017).10.1080/00207721.2017.1387314Search in Google Scholar

[6] A. Moghaddam, F. Yalaoui, L. Amodeo, “Lorenz versus Pareto dominance in a single machine scheduling problem with rejection”, Lecture Notes in Computer Science 6576, 520–534, (2011).10.1007/978-3-642-19893-9_36Search in Google Scholar

[7] A. Moghaddam, L. Amodeo, F. Yalaoui, B. Karimi “Single machine scheduling with rejection minimizing total weighted completion time and rejection cost”, International Journal of Applied Evolutionary Computation 3 (2), 42–61, (2012).10.4018/jaec.2012040103Search in Google Scholar

[8] A. Moghaddam, F. Yalaoui, L. Amodeo, “Efficient meta-heuristics based on various dominance criteria for a single-machine bi-criteria scheduling problem with rejection”, Journal of Manufacturing Systems 34(C), 12–22, (2015).10.1016/j.jmsy.2014.09.006Search in Google Scholar

[9] V. T'Kindt, J.-Ch. Billaut, “Multicriteria scheduling. Theory, Models and Algorithms”, Springer-Verlag Berlin Heidelberg New York (2002).10.1007/978-3-662-04986-0_4Search in Google Scholar

[10] E.L. Ulungu, J. Teghem, Ph. Fortemps, D. Tuyttens, “MOSA method : A tool for solving multi-objective combinatorial optimization problems”, Journal of Multi- Criteria Decision Analysis 8(4), 221–236, (1999).10.1002/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-OSearch in Google Scholar

[11] D.-J. Wang, Y. Yin, M. Liu, “Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity”, International Journal of Production Research 54(12), 3691–3705, (2016).10.1080/00207543.2015.1136081Search in Google Scholar

[12] L. Zhang, L. Lu, S. Li, “New results on two-machine flow-shop scheduling with rejection”, Journal of Combinatorial Optimization 31 (4), 1493–1504, (2016).10.1007/s10878-015-9836-3Search in Google Scholar

eISSN:
2300-3405
Language:
English
Publication timeframe:
4 times per year
Journal Subjects:
Computer Sciences, Artificial Intelligence, Software Development