Enrique Gerstl

22 papers Journal 22
YearRankTypeTitle / Venue / Authors
2025 J jnl
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times.
Optim. Lett.
Enrique Gerstl, Gur Mosheiov
2024 J jnl
Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem.
Eur. J. Oper. Res.
Dvir Shabtay, Enrique Gerstl
2023 J jnl
A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence.
J. Sched.
Enrique Gerstl, Gur Mosheiov
2023 J jnl
The LPT heuristic for minimizing total load on a proportionate openshop.
Discret. Appl. Math.
Enrique Gerstl, Gur Mosheiov
2021 J jnl
The single machine CON problem with unavailability period.
Int. J. Prod. Res.
Enrique Gerstl, Gur Mosheiov
2020 J jnl
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates.
J. Sched.
Enrique Gerstl, Gur Mosheiov
2019 J jnl
Scheduling on a proportionate flowshop to minimise total late work.
Int. J. Prod. Res.
Enrique Gerstl, Baruch Mor, Gur Mosheiov
2019 J jnl
Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion.
Int. J. Prod. Res.
Sergey Kovalev, Mikhail Y. Kovalyov, Gur Mosheiov, Enrique Gerstl
2017 J jnl
Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection.
Comput. Oper. Res.
Enrique Gerstl, Baruch Mor, Gur Mosheiov
2017 J jnl
Minmax weighted earliness-tardiness with identical processing times and two competing agents.
Comput. Ind. Eng.
Enrique Gerstl, Gur Mosheiov
2017 J jnl
Scheduling with two competing agents to minimize total weighted earliness.
Ann. Oper. Res.
Enrique Gerstl, Baruch Mor, Gur Mosheiov
2017 J jnl
Single machine scheduling problems with generalised due-dates and job-rejection.
Int. J. Prod. Res.
Enrique Gerstl, Gur Mosheiov
2015 J jnl
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop.
Inf. Process. Lett.
Enrique Gerstl, Baruch Mor, Gur Mosheiov
2015 J jnl
Scheduling with a due-window for acceptable lead-times.
J. Oper. Res. Soc.
Enrique Gerstl, Gur Mosheiov
2014 J jnl
The optimal number of used machines in a two-stage flexible flowshop scheduling problem.
J. Sched.
Enrique Gerstl, Gur Mosheiov
2013 J jnl
An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs.
Inf. Process. Lett.
Enrique Gerstl, Gur Mosheiov
2013 J jnl
Due-window assignment problems with unit-time jobs.
Appl. Math. Comput.
Enrique Gerstl, Gur Mosheiov
2013 J jnl
Due-window assignment with identical jobs on parallel uniform machines.
Eur. J. Oper. Res.
Enrique Gerstl, Gur Mosheiov
2013 J jnl
Minmax due-date assignment with a time window for acceptable lead-times.
Ann. Oper. Res.
Enrique Gerstl, Gur Mosheiov
2013 J jnl
Scheduling problems with two competing agents to minimized weighted earliness-tardiness.
Comput. Oper. Res.
Enrique Gerstl, Gur Mosheiov
2012 J jnl
Scheduling job classes on uniform machines.
Comput. Oper. Res.
Enrique Gerstl, Gur Mosheiov
2012 J jnl
Scheduling on parallel identical machines with job-rejection and position-dependent processing times.
Inf. Process. Lett.
Enrique Gerstl, Gur Mosheiov