Zobrazeno 1 - 10
of 150
pro vyhledávání: '"Gur Mosheiov"'
Publikováno v:
Advances in Operations Research, Vol 2009 (2009)
We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing time jobs, batch availability, and machine-dependent setup times. The objective is to find a job allocation to batches of integer size and a batch schedule that mi
Externí odkaz:
https://doaj.org/article/a13cf2458b1b4bdda67af71abedc0cdb
Publikováno v:
European Journal of Operational Research. 303:66-77
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c25fe54e921694f29842a54101eebd6
https://doi.org/10.1016/j.ejor.2022.02.017
https://doi.org/10.1016/j.ejor.2022.02.017
Autor:
Matan Atsmony, Gur Mosheiov
Publikováno v:
Journal of Scheduling. 26:193-207
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1774453fac6192de2b3b500b730f0a1
https://doi.org/10.1007/s10951-022-00745-7
https://doi.org/10.1007/s10951-022-00745-7
Publikováno v:
Journal of Scheduling. 25:577-587
We study two $$\mathcal {NP}$$ NP -hard single-machine scheduling problems with generalized due-dates. In such problems, due-dates are associated with positions in the job sequence rather than with jobs. Accordingly, the job that is assigned to posit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ecd1fc0086d46f82f6be7f430f24b354
https://doi.org/10.1007/s10951-022-00743-9
https://doi.org/10.1007/s10951-022-00743-9
Autor:
Enrique Gerstl, Gur Mosheiov
Publikováno v:
Journal of Scheduling.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8d6f1be9be1ab1505f5643865cc96ae
https://doi.org/10.1007/s10951-022-00772-4
https://doi.org/10.1007/s10951-022-00772-4
Publikováno v:
Journal of Scheduling.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e9c30d58dc2ccea32fbd3221ca98b3b
https://doi.org/10.1007/s10951-022-00763-5
https://doi.org/10.1007/s10951-022-00763-5
Publikováno v:
European Journal of Operational Research. 293:837-846
We study single machine scheduling problems with generalized due-dates. The scheduling measure is minimum total late work. We show that unlike the classical version (assuming job-specific due-dates), this problem has a polynomial time solution. Then,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c92ea84c7f15668422636e8fb2f8189d
https://doi.org/10.1016/j.ejor.2020.12.061
https://doi.org/10.1016/j.ejor.2020.12.061
Autor:
Baruch Mor, Gur Mosheiov
Publikováno v:
Annals of Operations Research. 305:191-209
We extend two classical scheduling and due-date assignment models. In the first (known in the literature as DIF), due-dates are determined by penalties for exceeding pre-specified deadlines. In the second (known as SLK), due-dates are assigned to job
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fd3b3a5821dbf170f8ebaa97b9b2f85
https://doi.org/10.1007/s10479-021-04212-y
https://doi.org/10.1007/s10479-021-04212-y
Publikováno v:
Journal of Scheduling. 24:553-567
We study a scheduling problem involving both partitioning and scheduling decisions. A solution for our problem is defined by (i) partitioning the set of jobs into a set of accepted and a set of rejected jobs and (ii) scheduling the set of accepted jo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e7b0c441d5f2379d00da217b5369d37
https://doi.org/10.1007/s10951-021-00697-4
https://doi.org/10.1007/s10951-021-00697-4
Autor:
Gur Mosheiov, Daniel Oron
Publikováno v:
4OR.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04d388283b5bfe3185e315627532bb5f
https://doi.org/10.1007/s10288-022-00519-z
https://doi.org/10.1007/s10288-022-00519-z