• My Shodhganga
  • Receive email updates
  • Edit Profile

Shodhganga : a reservoir of Indian theses @ INFLIBNET

  • Shodhganga@INFLIBNET
  • Anna University
  • Faculty of Science and Humanities
Title: Contributions to the study on assignment problems in fuzzy environment
Researcher: Hema K
Keywords: Physical Sciences
Mathematics Applied
University: Anna University
Completed Date: 2019
Abstract: In real life, we are encountered with problems of allocating different personnel/workers to different jobs. It is to be kept in consideration that not everyone has the same ability to perform a given job. Different persons have different abilities to execute the same task and these different capabilities are expressed in terms of various parameters like cost/profit/time involved in executing a given job. Hence, it is to be decided that we need to assign different workers to different jobs so that, the cost of performing such job gets reduced to a considerable extent. Thus this specific thesis is devoted to analyze and find the optimum value of the assignment problem using different approaches so as to get the minimum cost or maximum profit either way. In all these approaches, it is to be remembered that costs/profits are considered as imprecise numbers. These approaches are surely easily understandable and applicable in real life assignment problems for decision makers and problem solvers as well. Assignment problem is a combinatorial optimization problem in the field of operations research. In real world situation, the objectives, constraints or parameters are imprecise, because a decision is often made on the basis of vague or ambiguous information. As a result of this in recent years, fuzzy approach plays a vital role. Fourier elimination method is proposed to find the optimal solution. Here the costs are taken as triangular fuzzy numbers and are converted into crisp or precise number using Graded mean integration representation. The illustrated numerical example shows the efficiency of the proposed method. newline
Pagination: xix, 161p.
Appears in Departments:
File Description SizeFormat 
Attached File24.51 kBAdobe PDF
738.6 kBAdobe PDF
211.51 kBAdobe PDF
93.77 kBAdobe PDF
325.6 kBAdobe PDF
248.83 kBAdobe PDF
691.53 kBAdobe PDF
416.13 kBAdobe PDF
586.5 kBAdobe PDF
426.51 kBAdobe PDF
366.66 kBAdobe PDF
366.36 kBAdobe PDF
403.24 kBAdobe PDF
243.12 kBAdobe PDF
396.47 kBAdobe PDF
268.77 kBAdobe PDF
215.69 kBAdobe PDF
199.36 kBAdobe PDF

Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).



  • Simple Search
  • Advanced Search
  • Deposit an Item
  • Deposit Instructions
  • Instructions for Students

Olson, Mark Allen (1991) Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/8ZCK-E373.

In this thesis I consider the problem of assigning a fixed and heterogeneous set of goods or services to a fixed set of individuals. I analyze this allocation problem with and without the use of monetary transfers to allocate good.

There are many applications in the literature associated with this problem. The usual approach to this problem has been to discuss the properties of individual mechanisms (variously called procedures, algorithms, or rules) to solve the problem, often ignoring the incentive properties. In this thesis I take a different approach, that is, to look at a large class of mechanisms and to determine the conditions necessary to induce mechanisms with desired optimality and incentive properties. This analytic technique is augmented by an experimental examination of some of the mechanisms that have been proposed to solve this problem. Mechanisms that use transfers and consider incentive properties exist in the literature, but mechanisms that do not use transfers do not. None of these mechanisms has been tested or compared. The thesis is divided into two chapters; in chapter I, I examine the class of nontransfer dominant and Nash strategy mechanisms, and in chapter II, I discuss the experimental tests of the known transfer mechanisms and of the nontransfer mechanisms discussed in chapter I.

In the first chapter of this thesis, I characterize the conditions necessary for a nontransfer mechanism to be implementable in dominant and Nash strategies. This characterization is an extension of the Gibbard-Satterthwaite theorem. One of the conditions, ordinality, explains a distinction that is observed in the mechanisms described in the literature, that is, the use of cardinal information when transfers are used, and the use of ordinal information when transfers are not used. In addition, I apply a little-known concept for strategic behavior, nonbossiness, which is a necessary condition for implementability.

In the second chapter of this thesis, I use experimental methods to explore some procedures that could be used to assign individuals to slots. I look at four mechanisms, two transfer mechanisms, a sealed-bid auction and a progressive auction, and two nontransfer mechanisms, a choice mechanism and a chit mechanism (which are also studied in part I of this thesis). The mechanisms were compared to their theoretical predictions and to each other. For the chit mechanism a genetic algorithm was used to compute the predicted outcome; since this is a new use for the technique, I discuss the methodology that I used.

The experimental results for the transfer auctions are similar to the results found for single and multiple unit auctions; that is, progressive auctions tend to be more efficient and extract higher revenue from the bidders. While the transfer mechanisms studied had the properties that they are efficient and extract surplus (in terms of revenue) from the bidders, nontransfer mechanisms retain most of the surplus for bidders but tend to be less efficient. The difference between the two classes of mechanisms was most apparent in a high-contention environment where the use of nontransfer mechanisms resulted in a much larger surplus to the individual bidders, and the transfer mechanisms resulted in slightly higher efficiencies (the differences in efficiencies were small in comparison to the differences in consumer surplus). In a low-contention environment the use of either a transfer or a nontransfer mechanism had little effect on either the efficiencies or the consumer surplus.

The results of this study are a first step to understanding the assignment problem and to understanding more difficult allocation problems with heterogeneous goods. Two simple results are evident from our results. In the low-contention environment the planner can choose among the mechanisms discussed and not be concerned about their relative merits, since there is little difference in the outcomes of these mechanisms; in the high-contention environment the planner must determine whether efficiency or consumer surplus is more important; if efficiency or revenue is most important then, the progressive auction is clearly superior, if consumer welfare is most important then the chit mechanism is superior.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:Mechanism Design, Experimental Economics, Assignment Problem, Nash and Bayesian equilibrium, Repeated Measures Analysis
Degree Grantor:California Institute of Technology
Division:Humanities and Social Sciences
Major Option:Social Science
Thesis Availability:Public (worldwide access)
Research Advisor(s):
Thesis Committee:
Defense Date:29 May 1991
Non-Caltech Author Email:molson (AT) olsonhome.org
Record Number:CaltechETD:etd-07232007-145323
Persistent URL:
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:2971
Deposited By: Imported from ETD-db
Deposited On:01 Aug 2007
Last Modified:21 Dec 2019 03:05

Thesis Files

Repository Staff Only: item control page

  • DSpace@MIT Home
  • MIT Libraries
  • Doctoral Theses

The multi-modal traffic assignment problem.


Terms of use

Description, date issued, collections.

Show Statistical Information

Assignment problems and their application in economics

Thumbnail Image

Publication or External Link

Four assignment problems are introduced in this thesis, and they are approached

based on the context they are presented in. The underlying graphs of

the assignment problems in this thesis are in most cases bipartite graphs with two

sets of vertices corresponding to the agents and the resources. An edge might show

the interest of an agent in a resource or willingness of a manufacturer to produce

the corresponding product of a market, to name a few examples.

The rst problem studied in this thesis is a two-stage stochastic matching

problem in both online and oine versions. In this work, which is presented in

Chapter 2 of this thesis, a coordinator tries to benet by having access to the

statistics of the future price discounts which can be completely unpredictable for

individual customers. In our model, individual risk-averse customers want to book

hotel rooms for their future vacation; however, they are unwilling to leave booking to

the last minute which might result in huge savings for them since they have to take

the risk of all the hotel rooms being sold out. Instead of taking this risk, individual

customers make contracts with a coordinator who can spread the risk over many

such cases and also has more information on the probability distribution of the future

prices. In the rst stage, the coordinator agrees to serve some buyers, and then in

the second stage, once the nal prices have been revealed, he books rooms for them

just as he promised. An agreement between the coordinator and each buyer consists

of a set of acceptable hotels for the customer and a single price. Two models for

this problem are investigated. In the rst model, the details of the agreements are

proposed by the buyer, and we propose a bicriteria-style approximation algorithm

that gives a constant-factor approximation to the objective function by allowing a

bounded fraction of our hotel bookings to overlap. In the second model, the details

of the agreements are proposed by the coordinator, and we show the prices yielding

the optimal prot up to a small additive loss can be found by a polynomial time

In the third chapter of this thesis, two versions of the online matching problem

are analyzed with a similar technique. Online matching problems have been studied

by many researchers recently due to their direct application in online advertisement

systems such as Google Adwords. In the online bipartite matching problem, the

vertices of one side are known in advance; however, the vertices of the other side

arrive one by one, and reveal their adjacent vertices on the oine side only upon

arrival. Each vertex can only be matched to an unmatched vertex once it arrives and

we cannot match or rematch the online vertex in the future. In the online matching

problem with free disposal, we have the option to rematch an already matched oine

vertex only if we eliminate its previous online match from the graph. The goal is to

maximize the expected size of the matching. We propose a randomized algorithm

that achieves a ratio greater than 0:5 if the online nodes have bounded degree. The

other problem studied in the third chapter is the edge-weighted oblivious matching in

which the weights of all the edges in the underlying graph are known but existence

of each edge is only revealed upon probing that edge. The weighted version of

the problem has applications in pay-per-click online advertisements, in which the

revenue for a click on a particular ad is known, but it is unknown whether the user

will actually click on that ad. Using a similar technique, we develop an algorithm

with approximation factor greater than 0:5 for this problem too.

In Chapter 4, a generalized version of the Cournot Competition (a foundational

model in economics) is studied. In the traditional version, rms are competing in

a single market with one heterogeneous good, and their strategy is the quantity

of good they produce. The price of the good is an inverse function of the total

quantity produced in the market, and the cost of production for each rm in each

market increases with the quantity it produces. We study Cournot Competition on

a bipartite network of rms and markets. The edges in this network demonstrate

access of a rm to a market. The price of the good in each market is again an

inverse function of the quantity of the good produced by the rms, and the cost of

production for each rm is a function of its production in dierent markets. Our

goal is to give polynomial time algorithms to nd the quantity produced by rms

in each market at the equilibrium for generalized cost and price functions.

The nal chapter of this thesis is on analyzing a problem faced by online

marketplaces such as Amazon and ebay which deal with huge datasets registering

transaction of merchandises between many buyers and sellers. As the size of datasets

grow, it is important that the algorithms become more selective in the amount of

data they store. Our goal is to develop pricing algorithms for social welfare (or

revenue) maximization that are appropriate for use with the massive datasets in

these networks. We specially focus on the streaming setting, the common model

for big data analysis. Furthermore, we include hardness results (lower bounds)

on the minimum amount of memory needed to calculate the exact prices and also

present algorithms which are more space ecient than the given lower bounds but

approximate the optimum prices for the goods besides the revenue or the social

welfare of the mechanism.

URI (handle)


Academia.edu no longer supports Internet Explorer.

To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to  upgrade your browser .

Enter the email address you signed up with and we'll email you a reset link.

  • We're Hiring!
  • Help Center

paper cover thumbnail


Profile image of Amir Rashid

Related Papers

Arxiv preprint arXiv: …

Bundit Laekhanukit

We consider the problem of finding semi-matching in bipartite graphs which is also exten-sively studied under various names in the scheduling literature. We give faster algorithms for both weighted and unweighted case. For the weighted case, we give an O(nm log n)-time algorithm, ...

assignment problem thesis

Computing Research Repository

Jittat Fakcharoenphol

Applied Mathematical Modelling

Gabriel Semanisin

An $(f,g)$-semi-matching in a bipartite graph $G=(U \cup V,E)$ is a set of edges $M \subseteq E$ such that each vertex $u\in U$ is incident with at most $f(u)$ edges of $M$, and each vertex $v\in V$ is incident with at most $g(v)$ edges of $M$. In this paper we give an algorithm that for a graph with $n$ vertices and $m$ edges, $n\le m$, constructs a maximum $(f,g)$-semi-matching in running time $O(m\cdot \min (\sqrt{\sum_{u\in U}f(u)}, \sqrt{\sum_{v\in V}g(v)}))$. Using the reduction of [5], our result on maximum $(f,g)$-semi-matching problem directly implies an algorithm for the optimal semi-matching problem with running time $O(\sqrt{n}m \log n)$.

Abstract We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Baïou and Balinski in 2002. By leveraging new structural properties and sophisticated data structures, we show how to solve this problem in O (mlog n) time on a bipartite instance with n vertices and m edges, improving the best known running time of O (mn).

Tigranuhy Grigoryan

Procedia Computer Science

Daniel Keren

Scholarly Journal of Mathematics & Science

Dama Academic Scholarly & Scientific Research Society

The aim of every business setup is to optimize cost (to maximize profit or minimize the cost of operation) while meeting certain constraints. In order to satisfy the demand of its customers, Latex Foam Rubber Products Limited has to arrange the limited number (fourteen) of vehicles at its disposal to send their products to their various depots.The assignments of these vehicles are made depending on the time an order is placed for the products and the truck available at that time. This work seeks to address the problemof finding efficient assignments of these fourteen vehicles to the sixteen majorroutes linking the factory to the termini destinations so as to minimize the totalcost (number of gallons of diesel) required for transporting the company's products to its customers along these routes. Data on the types of trucks, number of gallons of diesel used per trip by each of the trucks to transport latex foam products and final destinations of the trucks, was obtained from the sales manager of the company through questioning. The Munkres Assignment algorithm, which best solves assignment problems, was employed. The algorithm takes the cost matrix of the assignment problem as input and proceeds by manipulating rows and columns through addition and subtraction to find the optimal assignment. The problem was solved using MATLAB computer program. Search on the internet was used to obtain the related literature. Books from the main Library at Kwame Nkrumah University of Science and Technology and the Mathematics Department's library were read in the course of the project.

Journal of Scheduling

Magnus M. Halldorsson

European Journal of Operational Research

T. C. E. Cheng

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.


International Journal of Production Economics

Michael Pinedo

Theoretical Computer Science

Journal of Algorithms

Richard Ladner

reena amulraj

Discrete Applied Mathematics

Guillermo Durán

Magnus M. Halldorsson , Guy Kortsarz


  •   We're Hiring!
  •   Help Center
  • Find new research papers in:
  • Health Sciences
  • Earth Sciences
  • Cognitive Science
  • Mathematics
  • Computer Science
  • Academia ©2024
  • Bibliography
  • More Referencing guides Blog Automated transliteration Relevant bibliographies by topics
  • Automated transliteration
  • Relevant bibliographies by topics
  • Referencing guides

Broad thesis (arguable, but difficult to support with evidence) 

Michael Sandel’s arguments about genetic engineering do not take into consideration all the relevant issues.

This is an arguable claim because it would be possible to argue against it by saying that Michael Sandel’s arguments do take all of the relevant issues into consideration. But the claim is too broad. Because the thesis does not specify which “issues” it is focused on—or why it matters if they are considered—readers won’t know what the rest of the essay will argue, and the writer won’t know what to focus on. If there is a particular issue that Sandel does not address, then a more specific version of the thesis would include that issue—hand an explanation of why it is important.  

Arguable thesis with analytical claim 

While Sandel argues persuasively that our instinct to “remake” (54) ourselves into something ever more perfect is a problem, his belief that we can always draw a line between what is medically necessary and what makes us simply “better than well” (51) is less convincing.

This is an arguable analytical claim. To argue for this claim, the essay writer will need to show how evidence from the article itself points to this interpretation. It’s also a reasonable scope for a thesis because it can be supported with evidence available in the text and is neither too broad nor too narrow.  

Arguable thesis with normative claim 

Given Sandel’s argument against genetic enhancement, we should not allow parents to decide on using Human Growth Hormone for their children.

This thesis tells us what we should do about a particular issue discussed in Sandel’s article, but it does not tell us how we should understand Sandel’s argument.  

Questions to ask about your thesis 

  • Is the thesis truly arguable? Does it speak to a genuine dilemma in the source, or would most readers automatically agree with it?  
  • Is the thesis too obvious? Again, would most or all readers agree with it without needing to see your argument?  
  • Is the thesis complex enough to require a whole essay's worth of argument?  
  • Is the thesis supportable with evidence from the text rather than with generalizations or outside research?  
  • Would anyone want to read a paper in which this thesis was developed? That is, can you explain what this paper is adding to our understanding of a problem, question, or topic?
  • picture_as_pdf Thesis

Storage Location Assignment Problem in a Warehouse: A Literature Review

  • Conference paper
  • First Online: 23 May 2023
  • Cite this conference paper

assignment problem thesis

  • Lucy Medrano-Zarazúa 7 ,
  • Jania Astrid Saucedo-Martínez 7 &
  • Johanna Bolaños-Zuñiga 7  

Part of the book series: EAI/Springer Innovations in Communication and Computing ((EAISICC))

Included in the following conference series:

  • International Conference on Computer Science and Health Engineering

264 Accesses

Warehouse management is one of the many companies’ operations that is a main part of the supply chain. Storage takes up between 2 and 5% of the total cost of sales in an organization (Hwang and Cho (Comput Ind Eng 51(2):335–342, 2006)). The storage allocation of products is an activity inside the warehouses that help managing a good flow of the products. It is a complex issue since it depends on many parameters such as the number of spaces, the quantity of products, and the number of rack levels that are in the warehouse, and the resources to move, among other things. When optimizing the flow of operations in the warehouse, good decisions have to be made, and, in this work, through a systematic literature review, different academic papers published between 2005 and 2021 on the SLAP are analyzed and classified according to the solution methodology, objectives, and other characteristics, so that the most used methods in the literature are obtained for this type of problem as well as the parameters that are most taken into account to solve it.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save.

  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
  • Available as EPUB and PDF
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Accorsi, R., Manzini, R., Bortolini, M.: A hierarchical procedure for storage allocation and assignment within an order-picking system. a case study. Int. J. Logist. Res. Appl. 15 (6), 351–364 (2012).

Google Scholar  

Alvarán, G., D.F.E., Hincapié, J.A.G., Correa, J.H.R.: Aplicación de la programación entera binaria para resolver el problema simple de balanceo de linea de ensamble: un caso de estudio. Scientia et technica 2 (50), 84–89 (2012)

Ang, M., Lim, Y.F., Sim, M.: Robust storage assignment in unit-load warehouses. Manag. Sci. 58 (11), 2114–2130 (2012). https://doi.org/10.1287/mnsc.1120.1543

Article   Google Scholar  

Ansari, M., Smith, J.S.: Gravity clustering: A correlated storage location assignment problem approach. In: 2020 Winter Simulation Conference (WSC), pp. 1288–1299. IEEE, Piscataway (2020)

Bahrami, B., Piri, H., Aghezzaf, E.-H.: Class-based storage location assignment: an overview of the literature. In: 16th International Conference on Informatics in Control. Automation and Robotics (ICINCO 2019), pp. 390–397. Scitepress, Setúbal (2019)

BalaSundareshwaran, A., Abdul Rahaman, S., Balasubramani, K., Kumaraswamy, K., Muthuvairavasamy, R.: Habitat risk assessment along coastal Tamil Nadu, India—An integrated methodology for mitigating coastal hazards. In: Coastal Zone Management, pp. 515–542 (2018). ISBN 978-0-12-814350-6. https://doi.org/10.1016/B978-0-12-814350-6.00023-9

Ballesteros-Riveros, F.A., Arango-Serna, M.D., Adarme-Jaimes, W., Zapata-Cortes, J.A.: Storage allocation optimization model in a Colombian company. Dyna 86 (209), 255–260 (2019)

Battini, D., Glock, C.H., Grosse, E.H., Persona, A., Sgarbossa, F.: Human energy expenditure in order picking storage assignment. Comput. Ind. Eng. 94 (C), 147–157 (2016). ISSN 0360-8352. https://doi.org/10.1016/j.cie.2016.01.020

Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 3 edn. Wiley-Interscience, Hoboken (2006)

Book   MATH   Google Scholar  

Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust optimization. In: Robust optimization. Princeton University Press, Princeton (2009)

Bertsekas, D.P.: Rollout algorithms for discrete optimization: A survey. In: Handbook of Combinatorial Optimization, Zu, D., Pardalos, P. (Eds.). Springer, Berlin (2010)

Besharati Givi, M.K., Asadi, P., Bag, S., Yaduwanshi, D., Pal, S., Heidarzadeh, A., Mudani, S., Kazemi-Choobi, K., Hanifian, H., Braga, D., Silva-Magalhães, A., Moreira, P., Infante, V., Vidal, C., Akinlabi, E., Akinlabi, S., Arora, H., Mukherjee, S., Grewal, H., Zolghadr, P.: Advances in Friction-Stir Welding and Processing. Elsevier, Amsterdam (2014). ISBN 978-08-57094-54-4

Bindi, F., Manzini, R., Pareschi, A., Regattieri, A.: Similarity-based storage allocation rules in an order picking system: an application to the food service industry. Int. J. Logist. Res. Appl. 12 (4), 233–247 (2009)

Bodnar, P., Lysgaard, J.: A dynamic programming algorithm for the space allocation and aisle positioning problem. J. Operat. Res. Soc. 65 (9), 1315–1324 (2014). https://doi.org/10.1057/jors.2013.64

Bolanos-Zuñiga, J., Saucedo, J., Salais, T., Marmolejo, J.: Optimization of the storage location assignment and the picker-routing problem by using mathematical programming. Appl. Sci. 10 , 534 (2020). https://doi.org/10.3390/app10020534

Bortolini, M., Botti, L., Cascini, A., Gamberi, M., Mora, C., Pilati, F.: Unit-load storage assignment strategy for warehouses in seismic areas. Comput. Ind. Eng. 87 (C), 481–490 (2015). ISSN 0360-8352. https://doi.org/10.1016/j.cie.2015.05.023

Boysen, N., Stephan, K.: The deterministic product location problem under a pick-by-order policy. Discrete Appl. Math. 161 (18), 2862–2875 (2013). ISSN 0166-218X. https://doi.org/10.1016/j.dam.2013.07.002 . https://www.sciencedirect.com/science/article/pii/S0166218X13003120

Brynzér, H., Johansson, M.I.: Storage location assignment: using the product structure to reduce order picking times. Int. J. Prod. Econ. 46 (1), 595–603 (1996)

Charris, E., Rojas-Reyes, J., Montoya-Torres, J.: The storage location assignment problem: a literature review. Int. J. Ind. Eng. Comput. 10 , 07 (2018). https://doi.org/10.5267/j.ijiec.2018.8.001

Chen, L., Langevin, A., Riopel, D.: The storage location assignment and interleaving problem in an automated storage/retrieval system with shared storage. Int. J. Prod. Res. 48 (4), 991–1011 (2010)

Article   MATH   Google Scholar  

Chiang, D.M.-H., Lin, C.-P., Chen, M.-C.: The adaptive approach for storage assignment by mining data of warehouse management system for distribution centres. Enterp. Inf. Syst. 5 (2), 219–234 (2011). https://doi.org/10.1080/17517575.2010.537784

Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2022)

MATH   Google Scholar  

Cruz-Aceves, I., Cervantes-Sanchez, F., Hernandez-Aguirre, A., Hernández-González, M.A., Solorio-Meza, S.: Binary descriptor design for the automatic detection of coronary arteries using metaheuristics. In: Advanced Machine Vision Paradigms for Medical Image Analysis, pp. 169–188. Elsevier, Amsterdam (2021)

Cruz-Domínguez, O., Santos-Mayorga, R.: Artificial intelligence applied to assigned merchandise location in retail sales systems. South African J. Ind. Eng. 27 (1), 112–124 (2016)

Curtin, K.M.: Operations research. In: Kempf-Leonard, K. (ed.) Encyclopedia of Social Measurement, pp. 925–931. Elsevier, New York (2005). ISBN 978-0-12-369398-3. https://doi.org/10.1016/B0-12-369398-5/00534-X . https://www.sciencedirect.com/science/article/pii/B012369398500534X

Dantzig, G.B.: Reminiscences about the origins of linear programming. Oper. Res. Lett. 1 (2), 43–48 (1982)

Article   MathSciNet   Google Scholar  

Dawn Thompson, J.: Statistical alignment approaches. Statist. Bioinformat. 1 , 43–51 (2016)

Dechter, R.: chapter 7-stochastic greedy local search. In: Constraint Processing, The Morgan Kaufmann Series in Artificial Intelligence, pp. 191–208. Morgan Kaufmann, Burlington (2003)

Dijkstra, A., Roodbergen, K.J.: Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses. Transport. Res. Part E Logist. Transport. Rev. 102 , 04 (2017). https://doi.org/10.1016/j.tre.2017.04.003

Ene, S., Öztürk, N.: Storage location assignment and order picking optimization in the automotive industry. Int. J. Adv. Manufact. Technol. 60 , 1–11 (2011). https://doi.org/10.1007/s00170-011-3593-y

Ene, S., Küçükoğlu, İ., Aksoy, A., Öztürk, N.: A genetic algorithm for minimizing energy consumption in warehouses. Energy 114 , 973–980 (2016)

Flórez, J.M.C.: Métodos exactos y heurísticos en la solución de problemas de redes de transporte en las cadenas de suministros. Lupa Empresarial 1 , 44–63 (2017)

Franzke, T., Grosse, E.H.,, Glock, C.H., Elbert, R.: An investigation of the effects of storage assignment and picker routing on the occurrence of picker blocking in manual picker-to-parts warehouses. Int. J. Logist. Manag. 1 , 7–17 (2017)

Frazelle, E.H.: Stock location assignment and order picking productivity. PhD Thesis, Georgia Institute of Technology (1989)

Fumi, A., Scarabotti, L., Schiraldi, M.M.: Minimizing warehouse space with a dedicated storage policy. Int. J. Eng. Business Manag. 5 , 21 (2013). https://doi.org/10.5772/56756

Gagliardi, J.-P., Renaud, J., Ruiz, A.: On sequencing policies for unit-load automated storage and retrieval systems. Int. J. Prod. Res. 52 (4), 1090–1099 (2014)

Gu, J., Goetschalckx, M., McGinnis, L.F.: Research on warehouse operation: a comprehensive review. Eur. J. Operat. Res. 177 (1), 1–21 (2007). ISSN 0377-2217. https://doi.org/10.1016/j.ejor.2006.02.025 . https://www.sciencedirect.com/science/article/pii/S0377221706001056

Gu, J., Goetschalckx, M., McGinnis, L.F.: Solving the forward-reserve allocation problem in warehouse order picking systems. J. Operat. Res. Soc. 61 (6), 1013–1021 (2010). https://doi.org/10.1057/jors.2009.39

Guerriero, F., Musmanno, R., Pisacane, O., Rende, F.: A mathematical model for the multi-levels product allocation problem in a warehouse with compatibility constraints. Appl. Math. Modell. 37 (6), 4385–4398 (2013). ISSN 0307-904X. https://doi.org/10.1016/j.apm.2012.09.015 . https://www.sciencedirect.com/science/article/pii/S0307904X12005124

Guerriero, F., Pisacane, O., Rende, F.: Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints. Appl. Math. Modell. 39 (23–24), 7375–7389 (2015)

Ho, Y.-C., Liu, C.-F.: A design methodology for converting a regular warehouse into a zone-picking warehouse. J. Chinese Instit. Ind. Eng. 22 (4), 332–345 (2005)

Howard, R.A.: Dynamic programming. Manag. Sci. 12 (5), 317–348 (1966)

Hwang, H.S., Cho, G.S.: A performance evaluation model for order picking warehouse design. Comput. Ind. Eng. 51 (2), 335–342 (2006). ISSN 0360-8352. https://doi.org/10.1016/j.cie.2005.10.002 . https://www.sciencedirect.com/science/article/pii/S0360835206000994 . Special Issue: Logistics and Supply Chain Management

Jana, M., Biswas, S.: Intelligent and smart enabling technologies in advanced applications: recent trends. Recent Trends Comput. Intell. Enabled Res. 1 , 355–365 (2021)

Kim, B.S., Smith, J.S.: Slotting methodology using correlated improvement for a zone-based carton picking distribution system. Comput. Ind. Eng. 62 (1), 286–295 (2012)

Lacey, A., Luff, D.: Qualitative Data Analysis. Trent Focus, Sheffield (2001)

Larco, J., De Koster, R., Roodbergen, K.J., Dul, J.: Managing warehouse efficiency and worker discomfort through enhanced storage assignment decisions. Int. J. Prod. Res. 55 , 1–16 (2017). https://doi.org/10.1080/00207543.2016.1165880

Le-Duc*, T., De Koster, R.M.B.M.: Travel distance estimation and storage zone optimization in a 2-block class-based storage strategy warehouse. Int. J. Prod. Res. 43 (17), 3561–3581 (2005)

Malekian, A., Chitsaz, N.: Concepts, procedures, and applications of artificial neural network models in streamflow forecasting. In: Advances in Streamflow Forecasting, pp. 115–147. Elsevier, Amsterdam (2021)

Manzini, R., Bindi, F., Pareschi, A.: The threshold value of group similarity in the formation of cellular manufacturing systems. Int. J. Prod. Res. 48 (10), 3029–3060 (2009)

Martınez-Alfaro, H., Gomez-Garcıa, S.: Mobile robot path planning and tracking using simulated annealing and fuzzy logic control. Expert Syst. Appl. 15 (3–4), 421–429 (1998)

Martínez, J.A.S.: VerificaciÓn y empleo computacional de un modelo matemÁtico utilizado para un layout en un centro de distribuciÓn. Repositorio UANL (2005)

Meneghetti, A., Monti, L.: Multiple-weight unit load storage assignment strategies for energy-efficient automated warehouses. Int. J. Logist. Res. Appl. 17 (4), 304–322 (2014)

Ming-Huang Chiang, D., Lin, C.-P., Chen, M.-C.: Data mining based storage assignment heuristics for travel distance reduction. Expert Syst. 31 (1), 81–90 (2014)

Pan, J.C.-H., Shih, P.-H., Wu, M.-H., Lin, J.-H.: A storage assignment heuristic method based on genetic algorithm for a pick-and-pass warehousing system. Comput. Ind. Eng. 81 , 1–13 (2015)

Park, C., Tsui, K.-L.: A profile monitoring of the multi-stage process. Qual. Technol. Quantit. Manag. 16 (4), 407–423 (2019)

Pérez, M.M.: Optimización en la disposición del espacio de almacenaje en un centro de distribución. Repositorio UANL (2005)

Quintana Peña, A.: Metodología de investigación científica cualitativa (2006). http://biblioteca.udgvirtual.udg.mx/jspui/handle/123456789/2724

Ramtin, F., Pazour, J.A.: Product allocation problem for an AS/RS with multiple in-the-aisle pick positions. IIE Trans. 47 (12), 1379–1396 (2015). https://doi.org/10.1080/0740817X.2015.1027458

Roy, K., Kar, S., Das, R.N.: Understanding the Basics of QSAR for Applications in Pharmaceutical Sciences and Risk Assessment. Academic, Cambridge (2015)

Sampat, A.M., Martin, E., Martin, M., Zavala, V.M., Optimization formulations for multi-product supply chain networks. Comput. Chem. Eng. 104 , 296–310 (2017)

Sharma, S., Shah, B.: A proposed hybrid storage assignment framework: a case study. Int. J. Prod. Perform. Manag. 64 , 870–892 (2015)

Sörensen, K.: Metaheuristics–the metaphor exposed. Int. Trans. Oper. Res. 22 (1), 3–18 (2015)

Article   MathSciNet   MATH   Google Scholar  

Sormaz, D., Sarkar, A.: Process sequencing for features with multiple processing requirements. Procedia Manufact. 38 , 726–734 (2019). https://doi.org/10.1016/j.promfg.2020.01.098

Todd, P.M.: Heuristics for decision and choice. In: Smelser, N.J., Baltes, P.B. (eds.) International Encyclopedia of the Social & Behavioral Sciences, pp. 6676–6679. Pergamon, Oxford (2001). ISBN 978-0-08-043076-8. https://doi.org/10.1016/B0-08-043076-7/00629-X . https://www.sciencedirect.com/science/article/pii/B008043076700629X

Tompkins, J.A., White, J.A., Bozer, Y.A., Frazelle, E.H., Tanchoco, J.M.A., Trevino, J.: Facilities Planning, pages 36–47, 2nd edn. Willey, Hoboken (1996)

Tu, M., Yang, M.-F., Kao, S.-L., Lin, F.-C., Ming-Hung, W., Lin, C.-K.: Using a heuristic multi-objective genetic algorithm to solve the storage assignment problem for CPS-based pick-and-pass system. Enterpr. Informat. Syst. 15 (9), 1238–1259 (2021)

Verhoeven, M.G.A., Aarts, E.H.L., Swinkels, P.C.J.: A parallel 2-opt algorithm for the traveling salesman problem. Future Gener. Comput. Syst. 11 (2), 175–182 (1995)

Viveros, P., González, K., Mena, R., Kristjanpoller, F., Robledo, J.: Slotting optimization model for a warehouse with divisible first-level accommodation locations. Appl. Sci. 11 (3), 936 (2021)

Wutthisirisart, P., Noble, J.S., Alec Chang, C.: A two-phased heuristic for relation-based item location. Comput. Ind. Eng. 82 (C), 94–102 (2015). ISSN 0360-8352. https://doi.org/10.1016/j.cie.2015.01.020

Xiao, J., Zheng, L.: A correlated storage location assignment problem in a single-block-multi-aisles warehouse considering BOM information. Int. J. Prod. Res. 48 (5), 1321–1338 (2010)

Yang, M.-F.: Using simulation to object-oriented order picking system. Informat. Technol. J. 7 (1), 224–227 (2008)

Yang, T., Peters, B.A.: Flexible machine layout design for dynamic and uncertain production environments. Eur. J. Oper. Res. 108 (1), 49–64 (1998)

Yang, P., Miao, L., Xue, Z., Qin, L.: An integrated optimization of location assignment and storage/retrieval scheduling in multi-shuttle automated storage/retrieval systems. J. Intell. Manufact. 26 , 11 (2013). https://doi.org/10.1007/s10845-013-0846-7

Yang, P., Peng, Y., Ye, B., Miao, L.: Integrated optimization of location assignment and sequencing in multi-shuttle automated storage and retrieval systems under modified 2n-command cycle pattern. Eng. Optim. 49 (9), 1604–1620 (2017). https://doi.org/10.1080/0305215X.2016.1261128

Yilmaz Balaman, S.: Modeling and optimization approaches in design and management of biomass-based production chains. Basic Concepts Methodol. 185–236 (2019). ISBN 9780128142783. https://doi.org/10.1016/B978-0-12-814278-3.00007-8

Yu, Y., De Koster, R.B.: On the suboptimality of full turnover-based storage. Int. J. Prod. Res. 51 (6), 1635–1647 (2013)

Yuan, R., Li, J., Wang, W., Dou, J., Pan, L.: Storage assignment optimization in robotic mobile fulfillment systems. Complexity 2021 , 1–11 (2021)

Zaerpour, N., De Koster, R.B.M., Yu, Y.: Storage policies and optimal shape of a storage system. Int. J. Prod. Res. 51 (23–24), 6891–6899 (2013)

Zhang, G., Nishi, T., Turner, S., Oga, K., Li, X.: An integrated strategy for a production planning and warehouse layout problem: modeling and solution approaches. Omega 68 , 85–94 (2017). https://doi.org/10.1016/j.omega.2016.06.005

Zhang, R.-Q., Wang, M., Pan, X.: New model of the storage location assignment problem considering demand correlation pattern. Comput. Ind. Eng. 129 , 210–219 (2019)

Zhang, G., Shang, X., Alawneh, F., Yang, Y., Nishi, T.: Integrated production planning and warehouse storage assignment problem: an IoT assisted case. Int. J. Prod. Econ. 234 , 108058 (2021)

Zhou, K., Wan, W., Chen, X., Shao, Z., Biegler, L.T.: A parallel method with hybrid algorithms for mixed integer nonlinear programming. In: Computer Aided Chemical Engineering, vol. 32, pp. 271–276. Elsevier, Amsterdam (2013)

Download references


Supported by PAICYT 547-IT-2022.

Author information

Authors and affiliations.

Universidad Autónoma de Nuevo León, San Nicolás de los Garza, Mexico

Lucy Medrano-Zarazúa, Jania Astrid Saucedo-Martínez & Johanna Bolaños-Zuñiga

You can also search for this author in PubMed   Google Scholar

Editor information

Editors and affiliations.

Engineering Department, National Autonomous University of Mexico, Mexico City, Distrito Federal, Mexico

José Antonio Marmolejo-Saucedo

Facultad de Ciencias Economicas Y Empresariales, Universidad Panamericana, Ciudad de Mexico, Mexico

Roman Rodríguez-Aguilar

Universiti Teknologi Petronas, Tronoh, Perak, Malaysia

Pandian Vasant

Graduate Program in Systems Engineering, Nuevo Leon State University, San Nicolás de los Garza, Mexico

Igor Litvinchev

School of Engineering, Universidad Anahuac México, Naucalpan de Juárez, Mexico

Brenda M. Retana-Blanco

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Cite this paper.

Medrano-Zarazúa, L., Saucedo-Martínez, J.A., Bolaños-Zuñiga, J. (2024). Storage Location Assignment Problem in a Warehouse: A Literature Review. In: Marmolejo-Saucedo, J.A., Rodríguez-Aguilar, R., Vasant, P., Litvinchev, I., Retana-Blanco, B.M. (eds) Computer Science and Engineering in Health Services. COMPSE 2022. EAI/Springer Innovations in Communication and Computing. Springer, Cham. https://doi.org/10.1007/978-3-031-34750-4_2

Download citation

DOI : https://doi.org/10.1007/978-3-031-34750-4_2

Published : 23 May 2023

Publisher Name : Springer, Cham

Print ISBN : 978-3-031-34749-8

Online ISBN : 978-3-031-34750-4

eBook Packages : Engineering Engineering (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

  • Publish with us

Policies and ethics

  • Find a journal
  • Track your research
  • Career Advice

Anatomy of an AI Essay

How might you distinguish one from a human-composed counterpart? After analyzing dozens, Elizabeth Steere lists some key, rather predictable features.

By  Elizabeth Steere

You have / 5 articles left. Sign up for a free account or log in.

Human hand writing in script while a robot hand types on a laptop

baona /iStock/Getty images Plus

Since OpenAI launched ChatGPT in 2022, educators have been grappling with the problem of how to recognize and address AI-generated writing. The host of AI-detection tools that have emerged over the past year vary greatly in their capabilities and reliability. For example, mere months after OpenAI launched its own AI detector, the company shut it down due to its low accuracy rate.

Understandably, students have expressed concerns over the possibility of their work receiving false positives as AI-generated content. Some institutions have disabled Turnitin’s AI-detection feature due to concerns over potential false allegations of AI plagiarism that may disproportionately affect English-language learners . At the same time, tools that rephrase AI writing—such as text spinners, text inflators or text “humanizers”—can effectively disguise AI-generated text from detection. There are even tools that mimic human typing to conceal AI use in a document’s metadata.

While the capabilities of large language models such as ChatGPT are impressive, they are also limited, as they strongly adhere to specific formulas and phrasing . Turnitin’s website explains that its AI-detection tool relies on the fact that “GPT-3 and ChatGPT tend to generate the next word in a sequence of words in a consistent and highly probable fashion.” I am not a computer programmer or statistician, but I have noticed certain attributes in text that point to the probable involvement of AI, and in February, I collected and quantified some of those characteristics in hopes to better recognize AI essays and to share those characteristics with students and other faculty members.

I asked ChatGPT 3.5 and the generative AI tool included in the free version of Grammarly each to generate more than 50 analytical essays on early American literature, using texts and prompts from classes I have taught over the past decade. I took note of the characteristics of AI essays that differentiated them from what I have come to expect from their human-composed counterparts. Here are some of the key features I noticed.

AI essays tend to get straight to the point. Human-written work often gradually leads up to its topic, offering personal anecdotes, definitions or rhetorical questions before getting to the topic at hand.

AI-generated essays are often list-like. They may feature numbered body paragraphs or multiple headings and subheadings.

The paragraphs of AI-generated essays also often begin with formulaic transitional phrases. As an example, here are the first words of each paragraph in one essay that ChatGPT produced:

  • “In contrast”
  • “Furthermore”
  • “On the other hand”
  • “In conclusion.”

Notably, AI-generated essays were far more likely than human-written essays to begin paragraphs with “Furthermore,” “Moreover” and “Overall.”

AI-generated work is often banal. It does not break new ground or demonstrate originality; its assertions sound familiar.

AI-generated text tends to remain in the third person. That’s the case even when asked a reader response–style question. For example, when I asked ChatGPT what it personally found intriguing, meaningful or resonant about one of Edgar Allan Poe’s poems, it produced six paragraphs, but the pronoun “I” was included only once. The rest of the text described the poem’s atmosphere, themes and use of language in dispassionate prose. Grammarly prefaced its answer with “I’m sorry, but I cannot have preferences as I am an AI-powered assistant and do not have emotions or personal opinions,” followed by similarly clinical observations about the text.

AI-produced text tends to discuss “readers” being “challenged” to “confront” ideologies or being “invited” to “reflect” on key topics. In contrast, I have found that human-written text tends to focus on hypothetically what “the reader” might “see,” “feel” or “learn.”

AI-generated essays are often confidently wrong. Human writing is more prone to hedging, using phrases like “I think,” “I feel,” “this might mean …” or “this could be a symbol of …” and so on.

AI-generated essays are often repetitive. An essay that ChatGPT produced on the setting of Rebecca Harding Davis’s short story “Life in the Iron Mills” contained the following assertions among its five brief paragraphs: “The setting serves as a powerful symbol,” “the industrial town itself serves as a central aspect of the setting,” “the roar of furnaces serve as a constant reminder of the relentless pace of industrial production,” “the setting serves as a catalyst for the characters’ struggles and aspirations,” “the setting serves as a microcosm of the larger societal issues of the time,” and “the setting … serves as a powerful symbol of the dehumanizing effects of industrialization.”

Editors’ Picks

  • DEI Ban Prompts Utah Colleges to Close Cultural Centers, Too
  • The End of Chevron Deference
  • U.S. Focused on Consumer Protection, Accountability in Rules Overhaul

AI writing is often hyperbolic or overreaching. The quotes above describe a “powerful symbol,” for example. AI essays frequently describe even the most mundane topics as “groundbreaking,” “vital,” “esteemed,” “invaluable,” “indelible,” “essential,” “poignant” or “profound.”

AI-produced texts frequently use metaphors, sometimes awkwardly. ChatGPT produced several essays that compared writing to “weaving” a “rich” or “intricate tapestry” or “painting” a “vivid picture.”

AI-generated essays tend to overexplain. They often use appositives to define people or terms, as in “Margaret Fuller, a pioneering feminist and transcendentalist thinker, explored themes such as individualism, self-reliance and the search for meaning in her writings …”

AI-generated academic writing often employs certain verbs. They include “delve,” “shed light,” “highlight,” “illuminate,” “underscore,” “showcase,” “embody,” “transcend,” “navigate,” “foster,” “grapple,” “strive,” “intertwine,” “espouse” and “endeavor.”

AI-generated essays tend to end with a sweeping broad-scale statement. They talk about “the human condition,” “American society,” “the search for meaning” or “the resilience of the human spirit.” Texts are often described as a “testament to” variations on these concepts.

AI-generated writing often invents sources. ChatGPT can compose a “research paper” using MLA-style in-text parenthetical citations and Works Cited entries that look correct and convincing, but the supposed sources are often nonexistent. In my experiment, ChatGPT referenced a purported article titled “Poe, ‘The Fall of the House of Usher,’ and the Gothic’s Creation of the Unconscious,” which it claimed was published in PMLA , vol. 96, no. 5, 1981, pp. 900–908. The author cited was an actual Poe scholar, but this particular article does not appear on his CV, and while volume 96, number 5 of PMLA did appear in 1981, the pages cited in that issue of PMLA actually span two articles: one on Frankenstein and one on lyric poetry.

AI-generated essays include hallucinations. Ted Chiang’s article on this phenomenon offers a useful explanation for why large language models such as ChatGPT generate fabricated facts and incorrect assertions. My AI-generated essays included references to nonexistent events, characters and quotes. For example, ChatGPT attributed the dubious quote “Half invoked, half spontaneous, full of ill-concealed enthusiasms, her wild heart lay out there” to a lesser-known short story by Herman Melville, yet nothing resembling that quote appears in the actual text. More hallucinations were evident when AI was generating text about less canonical or more recently published literary texts.

This is not an exhaustive list, and I know that AI-generated text in other formats or relating to other fields probably features different patterns and tendencies . I also used only very basic prompts and did not delineate many specific parameters for the output beyond the topic and the format of an essay.

It is also important to remember that the attributes I’ve described are not exclusive to AI-generated texts. In fact, I noticed that the phrase “It is important to … [note/understand/consider]” was a frequent sentence starter in AI-generated work, but, as evidenced in the previous sentence, humans use these constructions, too. After all, large language models train on human-generated text.

And none of these characteristics alone definitively point to a text having been created by AI. Unless a text begins with the phrase “As an AI language model,” it can be difficult to say whether it was entirely or partially generated by AI. Thus, if the nature of a student submission suggests AI involvement, my first course of action is always to reach out to the student themselves for more information. I try to bear in mind that this is a new technology for both students and instructors, and we are all still working to adapt accordingly.

Students may have received mixed messages on what degree or type of AI use is considered acceptable. Since AI is also now integrated into tools their institutions or instructors have encouraged them to use—such as Grammarly , Microsoft Word or Google Docs —the boundaries of how they should use technology to augment human writing may be especially unclear. Students may turn to AI because they lack confidence in their own writing abilities. Ultimately, however, I hope that by discussing the limits and the predictability of AI-generated prose, we can encourage them to embrace and celebrate their unique writerly voices.

Elizabeth Steere is a lecturer in English at the University of North Georgia.

Photo illustration of the United States showing the 10 states where the new Title IX regs are currently blocked from taking effect.

Title IX Legal Challenges Target LGBTQ+ Protections

Judges have temporarily blocked the new Title IX regulations in 10 red states so far.

Share This Article

More from teaching.

Young woman walks through Central Park in New York

Our students have been drifting away, Helen Kapstein writes, but we want them to drift back to the mindset of being c

Mother using smart phone while with her baby in a baby carrier

We See You, Student Parents

Alex Rockey recommends eight principles for transforming academic access for them through mobile-friendly courses.

View looking over shoulder of young instructor facing a classroom of seated college students

Beyond the Research

Michel Estefan offers a roadmap for helping graduate student instructors cultivate their distinct teaching style.

  • Become a Member
  • Sign up for Newsletters
  • Learning & Assessment
  • Diversity & Equity
  • Career Development
  • Labor & Unionization
  • Shared Governance
  • Academic Freedom
  • Books & Publishing
  • Financial Aid
  • Residential Life
  • Free Speech
  • Physical & Mental Health
  • Race & Ethnicity
  • Sex & Gender
  • Socioeconomics
  • Traditional-Age
  • Adult & Post-Traditional
  • Teaching & Learning
  • Artificial Intelligence
  • Digital Publishing
  • Data Analytics
  • Administrative Tech
  • Alternative Credentials
  • Financial Health
  • Cost-Cutting
  • Revenue Strategies
  • Academic Programs
  • Physical Campuses
  • Mergers & Collaboration
  • Fundraising
  • Research Universities
  • Regional Public Universities
  • Community Colleges
  • Private Nonprofit Colleges
  • Minority-Serving Institutions
  • Religious Colleges
  • Women's Colleges
  • Specialized Colleges
  • For-Profit Colleges
  • Executive Leadership
  • Trustees & Regents
  • State Oversight
  • Accreditation
  • Politics & Elections
  • Supreme Court
  • Student Aid Policy
  • Science & Research Policy
  • State Policy
  • Colleges & Localities
  • Employee Satisfaction
  • Remote & Flexible Work
  • Staff Issues
  • Study Abroad
  • International Students in U.S.
  • U.S. Colleges in the World
  • Intellectual Affairs
  • Seeking a Faculty Job
  • Advancing in the Faculty
  • Seeking an Administrative Job
  • Advancing as an Administrator
  • Beyond Transfer
  • Call to Action
  • Confessions of a Community College Dean
  • Higher Ed Gamma
  • Higher Ed Policy
  • Just Explain It to Me!
  • Just Visiting
  • Law, Policy—and IT?
  • Leadership & StratEDgy
  • Leadership in Higher Education
  • Learning Innovation
  • Online: Trending Now
  • Resident Scholar
  • University of Venus
  • Student Voice
  • Academic Life
  • Health & Wellness
  • The College Experience
  • Life After College
  • Academic Minute
  • Weekly Wisdom
  • Reports & Data
  • Quick Takes
  • Advertising & Marketing
  • Consulting Services
  • Data & Insights
  • Hiring & Jobs
  • Event Partnerships

4 /5 Articles remaining this month.

Sign up for a free account or log in.

  • Sign Up, It’s FREE

Exciting Seattle Mariners' Reliever Gets Timeline For When He'll Start Rehab Assignment

Brady farkas | jun 29, 2024.

Chicago White Sox relief pitcher Gregory Santos (60) celebrates a win against the Chicago Cubs at Wrigley Field in 2023.

  • Seattle Mariners

Seattle Mariners ' relief pitcher Gregory Santos took another major step forward in his recovery on Friday afternoon and it's led to some exciting news.

After throwing a 21-pitch live session at T-Mobile Park, we now know when Santos will begin his rehab assignment. He's been out all year with a lat issue.

Per @LookoutLanding on social media:

Justin Hollander says Gregory Santos will start a rehab assignment with Tacoma July 2nd

Justin Hollander says Gregory Santos will start a rehab assignment with Tacoma July 2nd — Lookout Landing (@LookoutLanding) June 28, 2024

Considering that Santos hasn't played in any games at all this year (he was injured in spring training), it's surprising to see him instantly come out of the gate at Triple-A, but Single-A Everett is on the road that day, so maybe this is just more about reducing travel than level of competition. Tacoma is home that day against Salt Lake City.

Given that Santos has been out all year, he'll require a lengthy rehab assignment that will have many more boxes to check. He'll need to show that he can throw all of his pitches, work on back-to-back days and show the ability to recover without discomfort. There has been hope that he'd be able to join the M's in July and that looks possible still at this point if everything goes well.

If and when Santos is able to join the team, he'll add another dimension to the back end of the bullpen for manager Scott Servais. He features an upper-90s fastball and has a ton of movement.

Here's what Ryan Bliss had to say after facing Bliss on Friday, per Curtis Crabtree:

Ryan Bliss faced Santos both in Tampa and here today and spoke highly of his stuff, especially his sinker. “It’s 98 with splitter movement. You just don’t see that. The ball drops out of nowhere. You don’t really see it. It’s something unique and it’s a really good pitch.”

Ryan Bliss faced Santos both in Tampa and here today and spoke highly of his stuff, especially his sinker. “It’s 98 with splitter movement. You just don’t see that. The ball drops out of nowhere. You don’t really see it. It’s something unique and it’s a really good pitch.” https://t.co/YY9OKLFh2V — Curtis Crabtree (@Curtis_Crabtree) June 28, 2024

The Mariners will play the Twins again on Saturday night at 7:10 p.m. PT.

Follow Inside the Mariners on social media

Continue to follow our Inside the Mariners coverage on social media by liking us on  Facebook  and by following Brady on "X" @ wdevradiobrady


Brady Farkas



Supported by

Abortion Debate Shifts as Election Nears: ‘Now It’s About Pregnancy’

Two years after Roe was struck down, the conversation has focused on the complications that can come with pregnancy and fertility, helping to drive more support for abortion rights.

  • Share full article

A crowd of people holding signs that support abortion rights in front of the Supreme Court building.

By Kate Zernike

In the decades that Roe v. Wade was the law of the land, abortion rights groups tried to shore up support for it by declaring “Abortion Is Health Care.”

Only now, two years after the Supreme Court eliminated the constitutional right to abortion, and just six months before the presidential election, has the slogan taken on the force of reality.

The public conversation about abortion has grown into one about the complexities of pregnancy and reproduction, as the consequences of bans have played out in the news. The question is no longer just whether you can get an abortion, but also, Can you get one if pregnancy complications put you in septic shock? Can you find an obstetrician when so many are leaving states with bans? If you miscarry, will the hospital send you home to bleed? Can you and your partner do in vitro fertilization?

That shift helps explain why a record percentage of Americans are now declaring themselves single-issue voters on abortion rights — especially among Black voters, Democrats, women and those ages 18 to 29 . Republican women are increasingly saying their party’s opposition to abortion is too extreme, and Democrats are running on the issue after years of running away from it.

“When the Dobbs case came down, I told my friends — somewhat but not entirely in jest — that America was about to be exposed to a lengthy seminar on obstetrics,” said Elaine Kamarck, a fellow at the Brookings Institution, referring to the Supreme Court decision that overturned Roe v. Wade.

Abortion opponents say that stories about women facing medical complications are overblown and that women who truly need abortions for medical reasons have been able to get them under exceptions to the bans.

We are having trouble retrieving the article content.

Please enable JavaScript in your browser settings.

Thank you for your patience while we verify access. If you are in Reader mode please exit and  log into  your Times account, or  subscribe  for all of The Times.

Thank you for your patience while we verify access.

Already a subscriber?  Log in .

Want all of The Times?  Subscribe .


  1. Chapter 1 JD Thesis Writing

    assignment problem thesis

  2. How To Write A Problem Statement For A Thesis

    assignment problem thesis

  3. (PDF) Applied in Assignment Problem Solving

    assignment problem thesis

  4. Thesis Problem Statement

    assignment problem thesis

  5. Assignment Problems

    assignment problem thesis

  6. Chapter FOUR. Assignment Problem

    assignment problem thesis


  1. Assignment Writing

    With real-time feedback, you can be confident your assignment will make the grade. Grammarly makes sure every assignment and paper is clear, effective, and mistake-free.

  2. PDF THE OPTIMAL ASSIGNMENT PROBLEM A Thesis Presented to the Division of

    The problem in this work will consider the case n=k. Mathematically stated the assignment problem is as follows: Let R be an n x n matrix with positive integer entries. The optimal assignment problem consists of choosing n entries, so that no two chosen entries come from the same row or column and such that the sum of the entries is maximized.

  3. Shodhganga@INFLIBNET: Contributions to the study on assignment problems

    Thus this specific thesis is devoted to analyze and find the optimum value of the assignment problem using different approaches so as to get the minimum cost or maximum profit either way. In all these approaches, it is to be remembered that costs/profits are considered as imprecise numbers. ... Assignment problem is a combinatorial optimization ...

  4. (PDF) An Assignment Problem and Its Application in ...

    Assignment problem arises in diverse situations, where one needs to determine an optimal way to assign n subjects to m subjects in the best possible way. With that, this paper classified ...

  5. The Assignment Problem: Theory and Experiments

    In this thesis I consider the problem of assigning a fixed and heterogeneous set of goods or services to a fixed set of individuals. I analyze this allocation problem with and without the use of monetary transfers to allocate good. There are many applications in the literature associated with this problem. The usual approach to this problem has ...

  6. The multi-modal traffic assignment problem

    Thesis. 1979. Ph.D.--Massachusetts Institute of Technology. Alfred P. Sloan School of Management. MICROFICHE COPY AVAILABLE IN ARCHIVES AND DEWEY. ... The multi-modal traffic assignment problem. Author(s) Aashtiani, Hedayat Zokaei. DownloadFull printable version (5.512Mb) Advisor. Thomas L. Magnanti.

  7. PDF On Approximation Methods for the Assignment Problem*

    Definition of Assignment Problem. The statement of the assignment problem is as follows: There are n men and n jobs, with a cost c, for assigning man i to job j. It is required to assign all men to jobs such that one and only one man is assigned to each job and the total cost of the assignments is minimal.

  8. Solving the Unbalanced Assignment Problem: Simpler Is Better

    The assignment problem (AP) is a well-known optimization problem that deals with the allocation of 'n' jobs to 'n' machines on a 1-to-1 basis. It minimizes the cost/time or maximizes the profit ...

  9. The assignment problem

    This Dissertation/Thesis is brought to you for free and open access by the Undergraduate Research & Artistry at Huskie Commons. It has been accepted for inclusion in Honors Capstones by an authorized administrator of ... Inthis assignment problem, mmustbeequal ton. Therefore, the matrix issquare. Thenumberofsolution variables inthe assignment ...


    linear assignment problem (LAP) and the quadratic assignment problem (QAP) will be given. The latter being a more complicated generalization of the former, and the topic of this thesis. An explanation of the key differences between the two aforementioned problems will be given. The author feels that providing such an introduction will help


    ASSIGNMENT PROBLEM A THESIS Presented to The Faculty of the Division .of'Graduate Studies By William Russell Wentz In Partial Fulfillment ... sparse assignment problems, it would have to be modified to operate directly on a network representing only the viable assignment pairs. Recently, Glover et^ aj_. (11,12), Bradley et al. (5) and Langley


    thesis, namely the Birkho and von Neumann theorem, which will be pre-sented in chapter 5 together with two di erent proofs, the rst one based on matrix notation whereas the second proof is taking a graph approach. The secondary problem of this thesis, is a version of the assignment problem with

  13. The U.S. Army Officer-to-Unit Assignment Problem


  14. Dissertations / Theses: 'The assignment problem'

    Consult the top 50 dissertations / theses for your research on the topic 'The assignment problem.'. Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago ...

  15. PDF The Tail Assignment Problem

    The Aircraft Assignment problem is the problem of assigning flights to aircraft in such a way that some operational constraints are satisfied, and possibly that some objective function is optimized. We propose an approach to aircraft assignment which captures all op-erational constraints, including minimum connection times, airport curfews,

  16. PDF The Frequency Assignment Problem

    The Frequency Assignment Problem Angela Erika Koller Submitted for the degree of Doctor of Philosophy 2004 Abstract This thesis examines a wide collection of frequency assignment problems. One of the largest topics in this thesis is that of L(2,1)-labellings of outerplanar graphs.

  17. PDF Solving The Assignment Problems Directly Without Any Iterations

    The assignment problem is a standard topic discussed in operations research textbooks [8] and [10]. It is an important subject, put forward immediately after the transportation problem, is the assignment problem. This is particularly important in the theory of decision making. The assignment problem is one of the earliest

  18. Assignment problems and their application in economics

    Four assignment problems are introduced in this thesis, and they are approached based on the context they are presented in. The underlying graphs of the assignment problems in this thesis are in most cases bipartite graphs with two sets of vertices corresponding to the agents and the resources. An edge might show the interest of an agent in a resource or willingness of a manufacturer to ...

  19. How to Write a Problem Statement for a Thesis

    For example, you might write the following statement to contextualize your research on the negative effects of online learning on the mental health of high school students: Example 1: Mental health issues among students have been an increasing concern and hence a crucial matter to investigate. Example 2:


    Each of the many two-dimensional variations of the classical assignment problem has at least one counterpart in higher dimensions. This paper is a tutorial on these higher dimensional assignment models and their applications. It is a synthesis of a vast literature scattered throughout a great variety of journal articles and other miscellaneous ...


    1.2 PROBLEM STATEMENT The specific form of problem that this thesis seeks to solve is to mathematically model a company's staff job placement problem as an assignment problem and solve the problem. Assignment problem is a special type of transportation problem which is also a resource allocation problem.

  22. Dissertations / Theses: 'Assignment problem'

    List of dissertations / theses on the topic 'Assignment problem'. Scholarly publications with full text pdf download. Related research topic ideas.

  23. Thesis

    Thesis. Your thesis is the central claim in your essay—your main insight or idea about your source or topic. Your thesis should appear early in an academic essay, followed by a logically constructed argument that supports this central claim. A strong thesis is arguable, which means a thoughtful reader could disagree with it and therefore ...

  24. Storage Location Assignment Problem in a Warehouse: A ...

    The storage location assignment problem (SLAP) is an important step when we are designing a warehouse layout, and this step influences in the arranging, picking process, sorting, ... Frazelle, E.H.: Stock location assignment and order picking productivity. PhD Thesis, Georgia Institute of Technology (1989) Google Scholar

  25. Ways to distinguish AI-composed essays from human-composed ones (opinion)

    Since OpenAI launched ChatGPT in 2022, educators have been grappling with the problem of how to recognize and address AI-generated writing. The host of AI-detection tools that have emerged over the past year vary greatly in their capabilities and reliability. For example, mere months after OpenAI launched its own AI detector, the company shut it down due to its low accuracy rate.

  26. Exciting Seattle Mariners' Reliever Gets Timeline For When He'll Start

    After being out all season with a lat problem, we now know when Seattle Mariners' reliever Gregory Santos will start his rehab assignment. Brady Farkas | Jun 29, 2024

  27. Abortion Rights Debate Shifts to Pregnancy and Fertility as Election

    Two years after Roe was struck down, the conversation has focused on the complications that can come with pregnancy and fertility, helping to drive more support for abortion rights.