[1]
|
M. Abouei Ardakan, A. Hakimian and M. T. Rezvan, A branch-and-bound algorithm for minimising the number of tardy jobs in a two-machine flow-shop problem with release datest, International Journal of Computer Integrated Manufacturing, 27 (2014), 519-528.
|
[2]
|
Ph. Baptiste, L. Peridy and E. Pinson, A branch and bound to minimize the number of late jobs on a single machine with release time constraints, European Journal of Operational Research, 144 (2003), 1-11.
|
[3]
|
J. C. Bean, Genetics and random keys for sequencing and optimization, ORSA Journal on Computing, 6 (1994), 154-160.
|
[4]
|
R. L. Bulfin and R. M'hallah, Minimizing the weighted number of tardy jobs on a two-machine flow shop, Computers & Operations Research, 30 (2003), 1887-1900.
doi: 10.1016/S0305-0548(02)00114-4.
|
[5]
|
W. Chen, Minimizing number of tardy jobs on a single machine subject to periodic maintenance, Omega, 37 (2009), 591-599.
|
[6]
|
T. Chiang and L. Fu, A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop, International Journal of Production Research, 46 (2008), 6913-6931.
|
[7]
|
S. W. Choi and Y. D. Kim, Minimizing total tardiness on a two-machine re-entrant flowshop, European Journal of Operational Research, 199 (2009), 375-384.
doi: 10.1016/j.ejor.2008.11.037.
|
[8]
|
H. S. Choi and D. H. Lee, Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops, Computers & Industrial Engineering, 56 (2009), 113-120.
|
[9]
|
D. T. Connolly, An improved annealing scheme for the QAP, European Journal of Operational Research, 46 (1990), 93-100.
doi: 10.1016/0377-2217(90)90301-Q.
|
[10]
|
C. Desprez, F. Chu and C. Chu, Minimising the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm, International Journal of Computer Integrated Manufacturing, 22 (2009), 745-757.
|
[11]
|
X. Feng, F. Zheng and Y. Xu, Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times, International Journal of Production Research, 54 (2016), 3706-3717.
|
[12]
|
E. M. González-Neira, J. R. Montoya-Torres and D. Barrera, Flow-shop scheduling problem under uncertainties: Review and trends, International Journal of Industrial Engineering Computations, 8 (2017), 399-426.
|
[13]
|
A. M. A. Hariri and C. N. Potts, A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop, European Journal of Operational Research, 38 (1989), 228-237.
doi: 10.1016/0377-2217(89)90107-0.
|
[14]
|
Ch. He, Y. Lin and J. Yuan, A note on the single machine scheduling to minimize the number of tardy jobs with deadlines, European Journal of Operational Research, 201 (2010), 966-970.
doi: 10.1016/j.ejor.2009.05.013.
|
[15]
|
F. Jolai, M. Rabbani, S. Amalnick, A. Dabaghi, M. Dehghan and M. Yazadn Parast, Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs, Applied Mathematics and Computation, 194 (2007), 552-560.
doi: 10.1016/j.amc.2007.04.063.
|
[16]
|
J. Lenstra, A. Rinnooy Kan and P. Brucker, Complexity of machine scheduling problems, Annals of Discrete Mathematics, 1 (1977), 343-362.
|
[17]
|
G. Sh. Liu, Y. Zhou and H. D. Yang, Minimizing energy consumption and tardiness penalty for fuzzy flow shop scheduling with state-dependent setup time, Journal of Cleaner Production, 147 (2017), 470-484.
|
[18]
|
M. Liu, Sh. Wang, Ch. Chu and F. Chu, An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance, International Journal of Production Research, 54 (2016), 3591-3602.
|
[19]
|
E. Lodree, W. Jang and C. M. Klein, A new rule for minimizing the number of tardy jobs in dynamic flow shops, European Journal of Operational Research, 159 (2004), 258-263.
doi: 10.1016/S0377-2217(03)00404-1.
|
[20]
|
M. Lundy and A. Mees, Convergence of an annealing algorithm, Mathematical Programming, 34 (1986), 111-124.
doi: 10.1007/BF01582166.
|
[21]
|
R. M'Hallah and T. Al-Khamis, A Benders decomposition approach to the weighted number of tardy jobs scheduling problem on unrelated parallel machines with production costs, International Journal of Production Research, 53 (2015), 5977-5987.
|
[22]
|
R. M'Hallah and R. L. Bulfin, Minimizing the weighted number of tardy jobs on a single machine with release dates, European Journal of Operational Research, 176 (2007), 727-744.
doi: 10.1016/j.ejor.2005.08.013.
|
[23]
|
M. Mirabi, SMT. Fatemi Ghomi and F. Jolai, A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem, Journal of Industrial Engineering International, 10 (2014), 1-9.
|
[24]
|
E. Molaee, Gh. Moslehi and M. Reisi, Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem, Computers & Mathematics with Applications, 60 (2010), 2909-2919.
doi: 10.1016/j.camwa.2010.09.046.
|
[25]
|
J. M. Moore, An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science, 15 (1968), 102-109.
|
[26]
|
G. Mosheiov and A. Sarig, Minimum weighted number of tardy jobs on an m-machine flow-shop with a critical machine, European Journal of Operational Research, 201 (2010), 404-408.
doi: 10.1016/j.ejor.2009.03.018.
|
[27]
|
Gh. Moslehi and M. Abouei Ardakan, Minimizing the number of Tardy jobs in a two-machine flowshop problem with non-simultaneous job entrance, International Journal of Industrial Engineering & amp; Production Management, 23 (2013), 389-400.
|
[28]
|
Gh. Moslehi and A. Jafari, Minimizing the number of tardy jobs under piecewise-linear deterioration, Computers & Industrial Engineering, 59 (2010), 573-584.
|
[29]
|
B. Naderi, E. Najafi and M. Yazdani, An electromagnetism-like metaheuristic for open-shop problems with no buffer, Journal of Industrial Engineering International, 8 (2012), 1-8.
|
[30]
|
S. Noori-Darvish and R. Tavakkoli-Moghaddam, Minimizing the total tardiness and makespan in an open shop scheduling problem with sequence-dependent setup times, Journal of Industrial Engineering International, 8 (2012), 1-13.
|
[31]
|
M. Rohaninejad, A. Saman Kheirkhah, B. Vahedi Nouri and P. Fattahi, Two hybrid tabu search-firefly algorithms for the capacitated job shop scheduling problem with sequence-dependent setup cost, International Journal of Computer Integrated Manufacturing, 28 (2015), 470-487.
|
[32]
|
A. J. Ruiz-Torres and G. Centeno, Minimizing the number of late jobs for the permutation flowshop problem with secondary resources, Computers & Operations Research, 35 (2008), 1227-1249.
doi: 10.1016/j.cor.2006.07.013.
|
[33]
|
A. J. Ruiz-Torres, J. H. Ablanedo-Rosas and J. C. Ho, Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility, Computers & Operations Research, 37 (2010), 282-291.
doi: 10.1016/j.cor.2009.04.018.
|
[34]
|
R. Şahin and O. Türkbey, A simulated annealing algorithm to find approximate Pareto optimal solutions for the multi-objective facility layout problem, The International Journal of Advanced Manufacturing Technology, 41 (2009), 1003-1018.
|
[35]
|
R. Sadykov, A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates, European Journal of Operational Research, 189 (2008), 1284-1304.
doi: 10.1016/j.ejor.2006.06.078.
|
[36]
|
G. Wan and B. P-C. Yen, Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs, European Journal of Operational Research, 195 (2009), 89-97.
doi: 10.1016/j.ejor.2008.01.029.
|
[37]
|
Zh. Wang, C. M. Wei and L. Sun, Solution algorithms for the number of tardy jobs minimisation scheduling with a time-dependent learning effect, International Journal of Production Research, (2016), 1-8.
|
[38]
|
J. Yuan, Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans, Journal of Combinatorial Optimization, 34 (2017), 443-440.
doi: 10.1007/s10878-016-0078-9.
|