Nasser Salmasi
Nasser Salmasi
Corning Incorporated
Verified email at lifetime.oregonstate.edu - Homepage
Title
Cited by
Cited by
Year
Total flow time minimization in a flowshop sequence-dependent group scheduling problem
N Salmasi, R Logendran, MR Skandari
Computers & Operations Research 37 (1), 199-212, 2010
992010
Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
R Logendran, N Salmasi, C Sriskandarajah
Computers & Operations Research 33 (1), 158-180, 2006
722006
An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems
O Shahvari, N Salmasi, R Logendran, B Abbasi
International Journal of Production Research 50 (15), 4237-4254, 2012
672012
A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem
D Hajinejad, N Salmasi, R Mokhtari
Scientia Iranica 18 (3), 759-764, 2011
562011
Permutation flowshops in group scheduling with sequence-dependent setup times
B Naderi, N Salmasi
European Journal of Industrial Engineering 6 (2), 177-198, 2012
492012
Makespan minimization of a flowshop sequence-dependent group scheduling problem
N Salmasi, R Logendran, MR Skandari
The International Journal of Advanced Manufacturing Technology 56 (5-8), 699-710, 2011
452011
Maximizing the nurses’ preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm
H Jafari, N Salmasi
Journal of industrial engineering international 11 (3), 439-458, 2015
382015
Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem
S Arabameri, N Salmasi
Computers & Industrial Engineering 64 (4), 902-916, 2013
352013
Stochastic scheduling with minimizing the number of tardy jobs using chance constrained programming
A Elyasi, N Salmasi
Mathematical and Computer Modelling 57, 1154-1164, 2013
342013
Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times
SA Mansouri, SH Hendizadeh, N Salmasi
The International Journal of Advanced Manufacturing Technology 40 (11), 1216 …, 2009
312009
A two-criteria objective function flexible flowshop scheduling problem with machine eligibility constraint
B Tadayon, N Salmasi
The International Journal of Advanced Manufacturing Technology 64 (5-8 …, 2013
272013
Stochastic flow-shop scheduling with minimizing the expected number of tardy jobs
A Elyasi, N Salmasi
The international journal of advanced manufacturing technology 66 (1-4), 337-346, 2013
232013
Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs
M Varmazyar, N Salmasi
International Journal of Production Research 50 (20), 5843-5858, 2012
232012
A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
T Keshavarz, M Savelsbergh, N Salmasi
Applied Mathematical Modelling 39 (20), 6410-6424, 2015
212015
Makespan minimisation in flexible flowshop sequence-dependent group scheduling problem
T Keshavarz, N Salmasi
International Journal of Production Research 51 (20), 6182-6193, 2013
192013
Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
T Keshavarz, N Salmasi, M Varmazyar
Annals of operations research 226 (1), 351-377, 2015
182015
Application of association rule mining in supplier selection criteria
A Haery, N Salmasi, MM Yazdi, H Iranmanesh
World Academy of Science, Engineering and Technology 40 (1), 358-362, 2008
162008
A heuristic approach for multi-stage sequence-dependent group scheduling problems
N Salmasi, R Logendran
JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL 4 (7), 48-58, 2008
152008
Multi-stage group scheduling problems with sequence dependent setups
N Salmasi
Oregon State University, 2005
152005
Makespan minimization in flowshop batch processing problem with different batch compositions on machines
HNZ Matin, N Salmasi, O Shahvari
International Journal of Production Economics 193, 832-844, 2017
142017
The system can't perform the operation now. Try again later.
Articles 1–20