Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Salim Rostami"'
This paper introduces a problem in which the state of a system needs to be determined through costly tests of its components by a limited number of testing units and before a given deadline. We also consider a closely related search problem in which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d589b64778852abaf08db11cc31dcba
http://hdl.handle.net/11365/1191825
http://hdl.handle.net/11365/1191825
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, Elsevier, 2019, 274 (3), pp.876-885. ⟨10.1016/j.ejor.2018.10.036⟩
European Journal of Operational Research, 2019, 274 (3), pp.876-885. ⟨10.1016/j.ejor.2018.10.036⟩
European Journal of Operational Research, Elsevier, 2019, 274 (3), pp.876-885. ⟨10.1016/j.ejor.2018.10.036⟩
European Journal of Operational Research, 2019, 274 (3), pp.876-885. ⟨10.1016/j.ejor.2018.10.036⟩
The goal of sequential testing is to discover the state of a system by testing its components one by one. We consider n-out-of-n systems, which function only if all n components work. The testing continues until the system state (up or down) is ident
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, 2019, 272 (1), pp.43-49. ⟨10.1016/j.ejor.2018.06.004⟩
European Journal of Operational Research, Elsevier, 2019, 272 (1), pp.43-49. ⟨10.1016/j.ejor.2018.06.004⟩
European Journal of Operational Research, 2019, 272 (1), pp.43-49. ⟨10.1016/j.ejor.2018.06.004⟩
European Journal of Operational Research, Elsevier, 2019, 272 (1), pp.43-49. ⟨10.1016/j.ejor.2018.06.004⟩
© 2018 Elsevier B.V. We tackle precedence-constrained sequencing on a single machine in order to minimize total weighted tardiness. Classic dynamic programming (DP) methods for this problem are limited in performance due to excessive memory requirem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58ca9f5fec566a5b9228cc58a8ac658e
https://hal.science/hal-01914859
https://hal.science/hal-01914859
Publikováno v:
Flexible Services and Manufacturing Journal
Flexible Services and Manufacturing Journal, In press, ⟨10.1007/s10696-018-9326-x⟩
Flexible Services and Manufacturing Journal, Springer, In press, ⟨10.1007/s10696-018-9326-x⟩
Flexible Services and Manufacturing Journal, In press, ⟨10.1007/s10696-018-9326-x⟩
Flexible Services and Manufacturing Journal, Springer, In press, ⟨10.1007/s10696-018-9326-x⟩
International audience; In this paper we propose a heuristic approach that computes the order in which patients will be treated in an ambulatory chemotherapy center. Each patient follows an individual treatment plan that fixes dates for series of dru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4ed9820ff81286f2f72278e9a830131
https://hal.science/hal-02056838
https://hal.science/hal-02056838
Publikováno v:
Journal of Scheduling
Journal of Scheduling, Springer Verlag, 2017, 21, pp.349-365. ⟨10.1007/s10951-016-0505-x⟩
Journal of Scheduling, 2017, 21, pp.349-365. ⟨10.1007/s10951-016-0505-x⟩
Journal of Scheduling, Springer Verlag, 2017, 21, pp.349-365. ⟨10.1007/s10951-016-0505-x⟩
Journal of Scheduling, 2017, 21, pp.349-365. ⟨10.1007/s10951-016-0505-x⟩
© 2017 Springer Science+Business Media New York We study the stochastic resource-constrained project scheduling problem or SRCPSP, where project activities have stochastic durations. A solution is a scheduling policy, and we propose a new class of p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61822ae563addb76449ae4ea8fbb2ef3
https://lirias.kuleuven.be/handle/123456789/560574
https://lirias.kuleuven.be/handle/123456789/560574
Publikováno v:
SSRN Electronic Journal.
Schrage and Baker (1978) proposed a generic dynamic programming (DP) algorithm to tackle precedenceconstrained sequencing on a single machine. The performance of their DP method, however, is limited due to excessive memory requirements, particularly
Publikováno v:
IEEM
In this article* we study the stochastic resource-constrained project scheduling problem or SRCPSP, where project activities have stochastic durations. A solution is a scheduling policy, and we propose a new class of policies that is a superset of mo