Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Medicinal Inventory Control in a University Health Centre
Date
1987-5
Author
Şatır, Ahmet
Cengiz, Dilek
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
107
views
0
downloads
Cite This
Subject Keywords
Marketing
,
Management Science and Operations Research
,
Strategy and Management
,
Management Information Systems
,
Management
URI
https://hdl.handle.net/11511/52101
Journal
The Journal of the Operational Research Society
DOI
https://doi.org/10.2307/2582728
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
ANTITHETIC BIAS REDUCTION FOR DISCRETE-EVENT SIMULATIONS
DELIGONUL, ZS (Informa UK Limited, 1987-05-01)
This study presents a technique for reducing the bias induced by arbitrary initial conditions in some discrete simulation studies. The technique relies on compensating the existing bias in a run by purposely introducing a deviation in the counter-direction during the subsequent run. Specifically, after obtaining a sample with initial condition X0, an antithetic companion run is generated starting from (2X̄ - X0). This introduces an adjustment equal and opposite to the indicated deviation, as measured by the...
LOT STREAMING IN A 2-STAGE FLOW-SHOP WITH SET-UP, PROCESSING AND REMOVAL TIMES SEPARATED
CETINKAYA, FC (Informa UK Limited, 1994-12-01)
This paper considers the job (lot) scheduling problem for two-stage flow shops in which the movement of transfer batches (sublots) from the first stage to the next are allowed. Set-up, processing and removal times are considered as separable and independent of the order in which jobs are processed at any of two stages. An optimal transfer batch sizing and scheduling algorithm which has an objective of minimizing the maximum flow time (makespan) is developed and demonstrated by a numerical example.
A resource investment problem with time/resource trade-offs
Colak, Erdem; Azizoğlu, Meral (Informa UK Limited, 2014-05-01)
In this study, we consider a Resource Investment Problem with time/resource trade-offs in project networks. We assume that there is a single renewable resource and the processing requirement of an activity can be reduced by investing extra resources. Our aim is to minimize the maximum resource usage, hence, the total amount invested for the single resource, while meeting the pre-specified deadline. We formulate the problem as a mixed integer linear model and find optimal solutions for small-sized problem in...
JOB-SHOP SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT
TOKER, A; KONDAKCI, S; ERKIP, N (JSTOR, 1994-08-01)
In this paper we consider the job shop scheduling problem under a discrete non-renewable resource constraint. We assume that jobs have arbitrary processing times and resource requirements and there is a unit supply of the resource at each time period. We develop an approximation algorithm for this problem and empirically test its effectiveness in finding the minimum makespan schedules.
Performance of the heuristic procedures for constrained projects with progress payments
Sepil, C; Ortac, N (Informa UK Limited, 1997-11-01)
All large scale resource constrained projects involve cash flows occurring during their life cycle. Several recent studies consider the problem of scheduling projects to maximise the net present value (NPV) of these cash flows. Their basic common assumption is that cash flows are mainly associated with specific events and they occur at event realisation times. An alternative assumption, which can be more realistic, is that cash inflows occur periodically, for example every month; as progress payments. This ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Şatır and D. Cengiz, “Medicinal Inventory Control in a University Health Centre,”
The Journal of the Operational Research Society
, 1987, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52101.