Scheduling High Multiplicity Coupled Tasks

Autor: Michaël Gabay, Wojciech Wojciechowicz

Publikováno v: Foundations of computing and decision sciences
Foundations of computing and decision sciences, 2020, 45 (1), pp.47-61. ⟨10.2478/fcds-2020-0004⟩
Foundations of Computing and Decision Sciences, Vol 45, Iss 1, Pp 47-61 (2020)

The coupled tasks scheduling problem is class of scheduling problems, where each task consists of two operations and a separation gap between them. The high-multiplicity is a compact encoding, where identical tasks are grouped together, and the group

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb93186e304ca826fccbbed2cbed97b8
https://doi.org/10.2478/fcds-2020-0004

The Clinical Practice of Drug Information

Autor: Michael Gabay

The Clinical Practice of Drug Information was named Rittenhouse Book Distributor's #1 title in their R2 Digital Library'Top 10 for 2015.'The Clinical Practice of Drug Information provides information on various resources, approaches to answering drug

High Multiplicity Scheduling with Switching Costs for few Products

Autor: Alexander Grigoriev, Vincent J. C. Kreuzen, Tim Oosterwijk, Michaël Gabay

Publikováno v: Annual International Conference of the German Operations Research Society (GOR)
Annual International Conference of the German Operations Research Society (GOR), Sep 2014, RWTH Aachen University, Germany. pp.437-443, ⟨10.1007/978-3-319-28697-6_61⟩
Gabay, M, Grigoriev, A, Kreuzen, V J & Oosterwijk, T 2016, High Multiplicity Scheduling with Switching Costs for few Products . in Operations Research Proceedings . vol. 2014, Springer .
Operations Research Proceedings 2014: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), RWTH Aachen University, Germany, September 2–5, 2014, 437-443
STARTPAGE=437;ENDPAGE=443;TITLE=Operations Research Proceedings 2014
Operations Research Proceedings, 2014
Operations Research Proceedings ISBN: 9783319286952
OR

We study a variant of the single machine capacitated lot-sizing problem with sequence-dependent setup costs and product-dependent inventory costs. We are given a single machine and a set of products associated with a constant demand rate, maximum loa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fac6590200d797d91ab8f15d2b4d97d
http://arxiv.org/abs/1504.00201v1

An efficient algorithm for semi-online multiprocessor scheduling with given total processing time

Autor: Michaël Gabay, Vladimir Kotov, Hans Kellerer

Publikováno v: Journal of Scheduling
Journal of Scheduling, Springer Verlag, 2015, 18, pp.623-630. ⟨10.1007/s10951-015-0430-4⟩

International audience; We consider a semi-online multiprocessor scheduling problem with a given a set of identical machines and a sequence of jobs, the sum of whose processing times is known in advance. The jobs are to be assigned online to one of t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ba373a522d55948839998b7450c1caf
https://hal.archives-ouvertes.fr/hal-01146372

Scheduling high multiplicity coupled tasks

Autor: Wojciech Wojciechowicz, Michaël Gabay, Pawlak, G., Nadia Brauner, Marie-Laure Espinouse

Publikováno v: ICOLE: Perspectives of Bioinformatics, Operations Research and Machine Learning conference
ICOLE: Perspectives of Bioinformatics, Operations Research and Machine Learning conference, 2012, Lessah, Austria
HAL

International audience

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7dba515f2f8a04016dd5428697dff616
https://hal.archives-ouvertes.fr/hal-00975708