default search action
Enrique Gerstl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j22]Enrique Gerstl
, Gur Mosheiov:
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times. Optim. Lett. 19(4): 833-845 (2025) - 2024
- [j21]Dvir Shabtay
Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem. Eur. J. Oper. Res. 316(3): 887-898 (2024) - 2023
- [j20]Enrique Gerstl
The LPT heuristic for minimizing total load on a proportionate openshop. Discret. Appl. Math. 338: 190-198 (2023) - [j19]Enrique Gerstl
A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence. J. Sched. 26(4): 403-409 (2023) - 2021
- [j18]Enrique Gerstl
The single machine CON problem with unavailability period. Int. J. Prod. Res. 59(3): 824-838 (2021) - 2020
- [j17]Enrique Gerstl
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates. J. Sched. 23(3): 289-299 (2020)
2010 – 2019
- 2019
- [j16]Enrique Gerstl
Scheduling on a proportionate flowshop to minimise total late work. Int. J. Prod. Res. 57(2): 531-543 (2019) - [j15]Sergey Kovalev, Mikhail Y. Kovalyov
Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion. Int. J. Prod. Res. 57(2): 560-566 (2019) - 2017
- [j14]Enrique Gerstl
Scheduling with two competing agents to minimize total weighted earliness. Ann. Oper. Res. 253(1): 227-245 (2017) - [j13]Enrique Gerstl
Minmax weighted earliness-tardiness with identical processing times and two competing agents. Comput. Ind. Eng. 107: 171-177 (2017) - [j12]Enrique Gerstl
Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection. Comput. Oper. Res. 83: 150-156 (2017) - [j11]Enrique Gerstl
Single machine scheduling problems with generalised due-dates and job-rejection. Int. J. Prod. Res. 55(11): 3164-3172 (2017) - 2015
- [j10]Enrique Gerstl
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop. Inf. Process. Lett. 115(2): 159-162 (2015) - [j9]Enrique Gerstl
Scheduling with a due-window for acceptable lead-times. J. Oper. Res. Soc. 66(9): 1578-1588 (2015) - 2014
- [j8]Enrique Gerstl
The optimal number of used machines in a two-stage flexible flowshop scheduling problem. J. Sched. 17(2): 199-210 (2014) - 2013
- [j7]Enrique Gerstl
Due-window assignment problems with unit-time jobs. Appl. Math. Comput. 220: 487-495 (2013) - [j6]Enrique Gerstl
Minmax due-date assignment with a time window for acceptable lead-times. Ann. Oper. Res. 211(1): 167-177 (2013) - [j5]Enrique Gerstl
Scheduling problems with two competing agents to minimized weighted earliness-tardiness. Comput. Oper. Res. 40(1): 109-116 (2013) - [j4]Enrique Gerstl
Due-window assignment with identical jobs on parallel uniform machines. Eur. J. Oper. Res. 229(1): 41-47 (2013) - [j3]Enrique Gerstl
An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs. Inf. Process. Lett. 113(19-21): 754-759 (2013) - 2012
- [j2]Enrique Gerstl
Scheduling job classes on uniform machines. Comput. Oper. Res. 39(9): 1927-1932 (2012) - [j1]Enrique Gerstl
Scheduling on parallel identical machines with job-rejection and position-dependent processing times. Inf. Process. Lett. 112(19): 743-747 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-12 21:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: