Výsledky vyhledávání - "Enrique Gerstl"

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

Publikováno v: Journal of Scheduling. 23:289-299

In scheduling problems with generalized due dates (gdd), the due dates are specified according to their position in the sequence, and the j-th due date is assigned to the job in the j-th position. We study a single-machine problem with generalized du

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::95b877392bf550b9abdeaff4bb90f369
https://doi.org/10.1007/s10951-020-00638-7

Zobrazit plný text záznamu

The single machine CON problem with unavailability period

Autor: Gur Mosheiov, Enrique Gerstl

Publikováno v: International Journal of Production Research. 59:824-838

The classical CON problem focuses on scheduling jobs on a single machine sharing a common due-date. We study the CON problem with a given unavailability period. The basic problem (assuming linear j...

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5ab07fc1d69956a527eb5e08e8f9f112
https://doi.org/10.1080/00207543.2019.1709672

Zobrazit plný text záznamu

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

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

Publikováno v: International Journal of Production Research. 57:560-566

The problem of minimising total absolute deviation of job completion times in a two-machine no-wait proportionate flow shop has been recently studied. It was shown that the LPT (largest processing ...

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9e72e921564ecb2f01caec2062e7655f
https://doi.org/10.1080/00207543.2018.1468097

Zobrazit plný text záznamu

Scheduling on a proportionate flowshop to minimise total late work

Autor: Baruch Mor, Gur Mosheiov, Enrique Gerstl

Publikováno v: International Journal of Production Research. 57:531-543

We study a scheduling problem to minimise total late work, i.e. each job is penalised according to the duration of its parts scheduled after its due-date. The machine setting is an m-machine propor...

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::59d1af54603be9249acd966946f897ac
https://doi.org/10.1080/00207543.2018.1456693

Zobrazit plný text záznamu

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

Autor: Gur Mosheiov, Enrique Gerstl, Baruch Mor

Publikováno v: Computers & Operations Research. 83:150-156

We study extensions of a minmax due-date assignment problem with a bound on due-dates.The first extension is to position-dependent processing times.A further extension is to a setting of due-window for acceptable lead-times.Theses extensions are show

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d7ad9b91b67a7ac60f6b0c5fb662b66
https://doi.org/10.1016/j.cor.2017.02.010

Zobrazit plný text záznamu

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

Autor: Enrique Gerstl, Gur Mosheiov

Publikováno v: Computers & Industrial Engineering. 107:171-177

We study a single-machine scheduling problem with competing agents and identical jobs.We focus on minmax weighted deviations of completion times from a common due-date.An extension to asymmetric cost structure is addressed.All models are extended to

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::cf1c2fabc02f5210d890abffa1861f44
https://doi.org/10.1016/j.cie.2017.03.011

Zobrazit plný text záznamu

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

Autor: Enrique Gerstl, Gur Mosheiov

Publikováno v: International Journal of Production Research. 55:3164-3172

We study single machine scheduling problems. Generalised due dates are assumed, i.e. job due dates are specified according to the positions of the jobs in the sequence, rather than their identity. Thus, assuming that due dates are numbered in a non-d

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::91cee658b7604fb0df3e68faf43ffdff
https://doi.org/10.1080/00207543.2016.1266055

Zobrazit plný text záznamu

Scheduling with two competing agents to minimize total weighted earliness

Autor: Baruch Mor, Enrique Gerstl, Gur Mosheiov

Publikováno v: Annals of Operations Research. 253:227-245

We study a single machine scheduling problem with two competing agents and earliness measures. Given a common deadline for all the jobs of both agents, the objective function is minimizing the total weighted earliness of the first agent, subject to a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::326d0fbac460fe5799e97bd17e0ad2fd
https://doi.org/10.1007/s10479-016-2310-5

Zobrazit plný text záznamu

Scheduling with a due-window for acceptable lead-times

Autor: Enrique Gerstl, Gur Mosheiov

Publikováno v: Journal of the Operational Research Society. 66:1578-1588

Due-dates are often determined during sales negotiations in two stages: (i) in the pre-sale stage, the customer provides a time interval (due-window) of his acceptable due-dates, (ii) in the second stage, the parties agree on the delivery penalties.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::77d51bc8a13f24ad6ac9b4c5c028841a
https://doi.org/10.1057/jors.2014.132

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání