Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Jayanth Krishna Mogali"'
Publikováno v:
European Journal of Operational Research. 295:82-101
The blocking job shop problem is a variant of the classical job shop problem, where a job continues to block a machine after being serviced, until the downstream machine needed by the job becomes available. Many real world problems have been modeled
Publikováno v:
Journal of Scheduling, 24(3), 291-318. Springer
This paper considers the problem of servicing a set of locations by a fleet of robots so as to minimize overall makespan. Although motivated by a specific real-world, multi-robot drilling and fastening application, the problem also arises in a range
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4001f706b72563360878fefb28447386
https://research.tue.nl/nl/publications/a4545ec9-e083-4c7d-98ce-609745b8f207
https://research.tue.nl/nl/publications/a4545ec9-e083-4c7d-98ce-609745b8f207
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030589417
CPAIOR
CPAIOR
We propose a polyhedral cutting plane procedure for computing a lower bound on the optimal solution to multi-agent path finding (MAPF) problems. We obtain our cuts by projecting the polytope representing the solutions to MAPF to lower dimensions. A n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6b13981947bdfaba1059d3dd2c368f19
https://doi.org/10.1007/978-3-030-58942-4_23
https://doi.org/10.1007/978-3-030-58942-4_23
Publikováno v:
ICIP
We propose a semi-automatic technique to segment corpus callosum (CC) using a two-stage snake formulation: A restricted affine transform (RAT) constrained snake followed by an unconstrained snake in an iterative fashion. A statistical model is develo