Enrique Gerstl
Orcid: 0000-0001-9158-984X
According to our database1,
Enrique Gerstl
authored at least 21 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem.
Eur. J. Oper. Res., 2024
2023
Discret. Appl. Math., October, 2023
A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence.
J. Sched., August, 2023
2021
2020
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates.
J. Sched., 2020
2019
Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion.
Int. J. Prod. Res., 2019
Int. J. Prod. Res., 2019
2017
Int. J. Prod. Res., 2017
Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection.
Comput. Oper. Res., 2017
Minmax weighted earliness-tardiness with identical processing times and two competing agents.
Comput. Ind. Eng., 2017
Ann. Oper. Res., 2017
2015
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop.
Inf. Process. Lett., 2015
2014
The optimal number of used machines in a two-stage flexible flowshop scheduling problem.
J. Sched., 2014
2013
An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs.
Inf. Process. Lett., 2013
Eur. J. Oper. Res., 2013
Scheduling problems with two competing agents to minimized weighted earliness-tardiness.
Comput. Oper. Res., 2013
Ann. Oper. Res., 2013
2012
Scheduling on parallel identical machines with job-rejection and position-dependent processing times.
Inf. Process. Lett., 2012