Enrique Gerstl

According to our database, Enrique Gerstl authored at least 20 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

The LPT heuristic for minimizing total load on a proportionate openshop.

Enrique Gerstl, Gur Mosheiov

Discret. Appl. Math., October, 2023

A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence.

Enrique Gerstl, Gur Mosheiov

J. Sched., August, 2023

2021

The single machine CON problem with unavailability period.

Enrique Gerstl, Gur Mosheiov

Int. J. Prod. Res., 2021

2020

Single machine scheduling to maximize the number of on-time jobs with generalized due-dates.

Enrique Gerstl, Gur Mosheiov

J. Sched., 2020

2019

Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion.

Sergey Kovalev, Mikhail Y. Kovalyov, Gur Mosheiov, Enrique Gerstl

Int. J. Prod. Res., 2019

Scheduling on a proportionate flowshop to minimise total late work.

Enrique Gerstl, Baruch Mor, Gur Mosheiov

Int. J. Prod. Res., 2019

2017

Single machine scheduling problems with generalised due-dates and job-rejection.

Enrique Gerstl, Gur Mosheiov

Int. J. Prod. Res., 2017

Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection.

Enrique Gerstl, Baruch Mor, Gur Mosheiov

Comput. Oper. Res., 2017

Minmax weighted earliness-tardiness with identical processing times and two competing agents.

Enrique Gerstl, Gur Mosheiov

Comput. Ind. Eng., 2017

Scheduling with two competing agents to minimize total weighted earliness.

Enrique Gerstl, Baruch Mor, Gur Mosheiov

Ann. Oper. Res., 2017

2015

Scheduling with a due-window for acceptable lead-times.

Enrique Gerstl, Gur Mosheiov

J. Oper. Res. Soc., 2015

A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop.

Enrique Gerstl, Baruch Mor, Gur Mosheiov

Inf. Process. Lett., 2015

2014

The optimal number of used machines in a two-stage flexible flowshop scheduling problem.

Enrique Gerstl, Gur Mosheiov

J. Sched., 2014

2013

An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs.

Enrique Gerstl, Gur Mosheiov

Inf. Process. Lett., 2013

Due-window assignment with identical jobs on parallel uniform machines.

Enrique Gerstl, Gur Mosheiov

Eur. J. Oper. Res., 2013

Scheduling problems with two competing agents to minimized weighted earliness-tardiness.

Enrique Gerstl, Gur Mosheiov

Comput. Oper. Res., 2013

Minmax due-date assignment with a time window for acceptable lead-times.

Enrique Gerstl, Gur Mosheiov

Ann. Oper. Res., 2013

Due-window assignment problems with unit-time jobs.

Enrique Gerstl, Gur Mosheiov

Appl. Math. Comput., 2013

2012

Scheduling on parallel identical machines with job-rejection and position-dependent processing times.

Enrique Gerstl, Gur Mosheiov

Inf. Process. Lett., 2012

Scheduling job classes on uniform machines.

Enrique Gerstl, Gur Mosheiov

Comput. Oper. Res., 2012