Double and Triple Optimization

Chrissoleon T. Papadopoulos (), Michael J. Vidalis (), Michael E. J. O’Kelly () and Diomidis Spinellis ()
Additional contact information
Chrissoleon T. Papadopoulos: Aristotle University of Thessaloniki
Michael J. Vidalis: University of the Aegean
Michael E. J. O’Kelly: National University of Ireland University College Galway
Diomidis Spinellis: University of Economics & Business

Chapter 6 in Analysis and Design of Discrete Part Production Lines, 2009, pp 161-177 from Springer

Abstract: Abstract There are three pure allocation problems, viz., the work-load allocation problem, the server allocation problem and the buffer allocation problem, all concerned with maximizing throughput. Mathematically, these problems may be described as follows: The work-load allocation problem, WAP: $$\max X({\bf w}) =\max X({w}_{1},{w}_{2}, \ldots ,{w}_{K})$$ subject to: $$\sum _{i=1}^{K}{w}_{ i} = 1,\ \ \ \mbox{ for ${w}_{i} > 0$}$$ for normalized total work-load equal to unity and fixed allocation of servers and fixed buffer allocation. The server allocation problem, SAP: $$\max X({\bf s}) =\max X({S}_{1},{S}_{2}, \ldots ,{S}_{K}))$$ subject to: $$\sum _{i=1}^{K}{S}_{ i} = S,\ \ \ \mbox{ for ${S}_{i} \geq 1$ and integer}$$ for fixed allocation of work to each station and fixed buffer allocation. The buffer allocation problem, BAP: $$\max X({\bf n}) = X({N}_{2}, \ldots ,{N}_{K})$$ subject to: $$\sum _{i=2}^{K}{N}_{ i} = N,\ \ \ \mbox{ for ${N}_{i} \geq 0$ and integer}$$ for fixed allocation of work to each station and fixed allocation of servers. As indicated above, there are three single-variable decision problems. Combining these problems into two-variable problems leads to the following three problems which may be mathematically described as follows: The combined work-load allocation and server allocation problems, W + S: $$\max X({\bf w},{\bf s})$$ subject to: $$\sum _{i=1}^{K}{w}_{ i} = 1,\ \ \ \mbox{ for ${w}_{i} > 0$ and normalized work-load}$$ and $$\sum _{i=1}^{K}{S}_{ i} = S,\ \ \ \mbox{ for ${S}_{i} \geq 1$ and integer}$$ and for fixed buffer allocation. The reader may note that this problem has already been discussed in Chapter 4.

Keywords: Simulated Annealing; Allocation Problem; Expansion Method; Service Time Distribution; Complete Enumeration (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-89494-2_6

Ordering information: This item can be ordered from
http://www.springer.com/9780387894942

DOI: 10.1007/978-0-387-89494-2_6

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().