Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Alan Soper"'
Publikováno v:
PLoS ONE, Vol 10, Iss 3, p e0120611 (2015)
The nucleation and growth of crystalline ice during cooling, and further crystallization processes during re-warming are considered to be key processes determining the success of low temperature storage of biological objects, as used in medical, agri
Externí odkaz:
https://doaj.org/article/e66fc3c4b9394f69805dfce58bf8b9d5
Autor:
Alan Soper, Vitaly A. Strusevich
We address single-machine scheduling problems for which the actual processing times of jobs are subject to various effects, including a positional effect, a cumulative effect and their combination. We review the known results on the problems to minim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebb769bc8832464342ba979bbb6566fa
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines
Autor:
Vitaly A. Strusevich, Alan Soper
Publikováno v:
Annals of Operations Research. 298:469-495
For a scheduling problem to minimize the makespan on three uniform parallel machines we present a parametric analysis of the quality of a schedule with at most one preemption compared to the global optimal schedule with any number of preemptions. A t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36fcfebd7b03db1e2dbd609aa9ae46d5
https://doi.org/10.1007/s10479-018-2952-6
https://doi.org/10.1007/s10479-018-2952-6
Autor:
Alan Soper, Vitaly A. Strusevich
Publikováno v:
The Second International Workshop on Dynamic Scheduling Problems.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44bc888c27a42cdced5ade54771e92da
https://doi.org/10.14708/isbn.978-83-951298-0-3p93-96
https://doi.org/10.14708/isbn.978-83-951298-0-3p93-96
Autor:
Alan Soper, Vitaly A. Strusevich
For a scheduling problem to minimize the makespan on parallel machines, we consider schedules with at most one preemption. We show that in the case of two uniform machines the problem is solvable in polynomial time. For m ≥ 3 uniform parallel machi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb89e96416c087e1bb9edaa2ccc0e191
For scheduling problems on parallel machines, the power of preemption is defined as the supremum ratio of the cost of an optimal nonpreemptive schedule over the cost of an optimal preemptive schedule (for the same input), where the cost is defined by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2cf6c5780a3e989a3b1299799041f8f1
Autor:
Alan Soper, Vitaly A. Strusevich
Publikováno v:
Discrete Optimization. 12:26-46
We consider scheduling problems on two and three uniform parallel machines. In the case of three machines we focus on the instances in which two machines have the same speed. For these models, we analyze the power of preemption defined as the ratio o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92353eb5f7818e5efe4033ba46bde885
https://doi.org/10.1016/j.disopt.2013.12.004
https://doi.org/10.1016/j.disopt.2013.12.004
Autor:
Alan Soper
Publikováno v:
Journal of Scheduling. 18:311-314
This paper considers scheduling problems on two machines to minimise the makespan. It shows that a simple cyclical search can find a flow shop schedule with one job omitted with makespan less than or equal to the maximum of the total processing time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a57836d9785b180f1a70648a30078099
https://doi.org/10.1007/s10951-013-0356-7
https://doi.org/10.1007/s10951-013-0356-7
Publikováno v:
Naval Research Logistics (NRL). 56:1-18
We consider the two-machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dea6a9dc5023fde454808bcae075fc1a
https://doi.org/10.1002/nav.20323
https://doi.org/10.1002/nav.20323
Autor:
Vitaly A. Strusevich, Alan Soper
Publikováno v:
International Journal of Foundations of Computer Science. 18:565-591
We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e9520a32c217bae1d8326943d2f3d44
https://doi.org/10.1142/s012905410700484x
https://doi.org/10.1142/s012905410700484x