| Scheduling problems with two competing agents to minimized weighted earliness–tardiness E Gerstl, G Mosheiov Computers & operations research 40 (1), 109-116, 2013 | 50 | 2013 |
| Single machine scheduling problems with generalised due-dates and job-rejection E Gerstl, G Mosheiov International Journal of Production Research 55 (11), 3164-3172, 2017 | 35 | 2017 |
| Scheduling on parallel identical machines with job-rejection and position-dependent processing times E Gerstl, G Mosheiov Information Processing Letters 112 (19), 743-747, 2012 | 33 | 2012 |
| Single machine just‐in‐time scheduling problems with two competing agents E Gerstl, G Mosheiov Naval Research Logistics (NRL) 61 (1), 1-16, 2014 | 31 | 2014 |
| Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection E Gerstl, B Mor, G Mosheiov Computers & Operations Research 83, 150-156, 2017 | 29 | 2017 |
| Scheduling on a proportionate flowshop to minimise total late work E Gerstl, B Mor, G Mosheiov International Journal of Production Research 57 (2), 531-543, 2019 | 23 | 2019 |
| A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop E Gerstl, B Mor, G Mosheiov Information Processing Letters 115 (2), 159-162, 2015 | 20 | 2015 |
| Due-window assignment with identical jobs on parallel uniform machines E Gerstl, G Mosheiov European Journal of Operational Research 229 (1), 41-47, 2013 | 17 | 2013 |
| Single machine scheduling to maximize the number of on-time jobs with generalized due-dates E Gerstl, G Mosheiov Journal of Scheduling 23 (3), 289-299, 2020 | 16 | 2020 |
| The optimal number of used machines in a two-stage flexible flowshop scheduling problem E Gerstl, G Mosheiov Journal of Scheduling 17, 199-210, 2014 | 16 | 2014 |
| Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion S Kovalev, MY Kovalyov, G Mosheiov, E Gerstl International Journal of Production Research 57 (2), 560-566, 2019 | 15 | 2019 |
| Due-window assignment problems with unit-time jobs E Gerstl, G Mosheiov Applied Mathematics and Computation 220, 487-495, 2013 | 15 | 2013 |
| Batch scheduling in a two-stage flexible flow shop problem E Gerstl, G Mosheiov, A Sarig Foundations of Computing and Decision Sciences 39 (1), 3-16, 2014 | 14 | 2014 |
| Minmax due-date assignment with a time window for acceptable lead-times E Gerstl, G Mosheiov Annals of Operations Research 211, 167-177, 2013 | 13 | 2013 |
| A two-stage flow shop batch-scheduling problem with the option of using not-all-machines E Gerstl, G Mosheiov International Journal of Production Economics 146 (1), 161-166, 2013 | 11 | 2013 |
| An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs E Gerstl, G Mosheiov Information Processing Letters 113 (19-21), 754-759, 2013 | 10 | 2013 |
| A two-stage flow shop scheduling with a critical machine and batch availability E Gerstl, G Mosheiov Foundations of Computing and Decision Sciences 37 (1), 39-56, 2012 | 10 | 2012 |
| The single machine CON problem with unavailability period E Gerstl, G Mosheiov International Journal of Production Research 59 (3), 824-838, 2021 | 8 | 2021 |
| Minmax weighted earliness-tardiness with identical processing times and two competing agents E Gerstl, G Mosheiov Computers & Industrial Engineering 107, 171-177, 2017 | 7 | 2017 |
| Scheduling with a due-window for acceptable lead-times E Gerstl, G Mosheiov Journal of the Operational Research Society 66 (9), 1578-1588, 2015 | 7 | 2015 |
Gur MosheiovHebrew UniversityVerified email at mail.huji.ac.il
