Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Tolga Cezik"'
Publikováno v:
INFORMS Journal on Applied Analytics.
This paper describes how Amazon redesigned the robotic picking algorithm used in Amazon Robotics (AR) fulfillment centers (FCs) to enable humans and robots to work together effectively. In AR FCs, robotic drives fetch storage pods filled with invento
Publikováno v:
Production and Operations Management.
Publikováno v:
SSRN Electronic Journal.
Online retail fulfillment is increasingly performed by semi-automated fulfillment systems in which inventory is stored in mobile pods that are moved by robotic drives. In this paper, we develop a model that explores the benefits of velocity-based sto
Publikováno v:
Prof. Graves
The stowage decision determines how arriving products are distributed in a storage system or warehouse. In particular, we consider the zone-stowage decision for large warehouses that are organised into distinct storage zones. An example would be a mu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89d31aaf35ce9b319f8586e7f12fa96c
https://orcid.org/0000-0002-2370-9296
https://orcid.org/0000-0002-2370-9296
Autor:
Pierre L'Ecuyer, Mehmet Tolga Cezik
Publikováno v:
Management Science. 54(2):310-323
We study an iterative cutting-plane algorithm on an integer program for minimizing the staffing costs of a multiskill call center subject to service-level requirements that are estimated by simulation. We solve a sample average version of the problem
Publikováno v:
Graves
Our research focuses on the storage decision in a semi-automated storage system. In a semi-automated storage system, the inventory is stored on mobile storage pods. In a typical system, each storage pod carries a mixture of items, and the inventory o
Autor:
Mehmet Tolga Cezik, Garud Iyengar
Publikováno v:
Mathematical Programming. 104:179-202
In this we paper we study techniques for generating valid convex constraints for mixed 0-1 conic programs. We show that many of the techniques developed for generating linear cuts for mixed 0-1 linear programs, such as the Gomory cuts, the lift-and-p
Autor:
Garud Iyengar, Mehmet Tolga Cezik
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783540422259
IPCO
IPCO
Since the seminal work of Nemirovski and Nesterov [14], research on semidefinite programming (SDP) and its applications in optimization has been burgeoning. SDP has led to good relaxations for the quadratic assignment problem, graph partition, non-co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b2fd9329150df1ac61cf50b5b0273d7
https://doi.org/10.1007/3-540-45535-3_20
https://doi.org/10.1007/3-540-45535-3_20