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
SIMULATION ANALYSIS OF A JIT PRODUCTION LINE
Date
1991-11-01
Author
MERAL, S
ERKIP, N
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
69
views
0
downloads
Cite This
Subject Keywords
Management Science and Operations Research
,
Economics and Econometrics
,
Industrial and Manufacturing Engineering
,
General Business, Management and Accounting
URI
https://hdl.handle.net/11511/65058
Journal
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
DOI
https://doi.org/10.1016/0925-5273(91)90161-l
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
Operational fixed interval scheduling problem on uniform parallel machines
Bekki, Oezguen Baris; Azizoğlu, Meral (Elsevier BV, 2008-04-01)
In this study, we address an operational fixed interval scheduling problem on uniform parallel machines. Our objective is to maximize the total weight of the jobs processed. We show that the problem is NP-hard in the strong sense and develop polynomial time algorithms for some special cases. We propose a branch and bound algorithm that employs dominance conditions and tight bounds. The results of our computational tests have revealed that the algorithm returns optimal solutions for problem instances with up...
A model to evaluate inventory costs in a remanufacturing environment
Bayındır, Zeynep Pelin; Gullu, R (Elsevier BV, 2003-01-11)
In this study we investigate possible benefits of remanufacturing in inventory-related costs. In order to examine the conditions on different system parameters that make the remanufacturing option cost attractive, the return ratio is considered as a decision variable. The production environment, where the manufacturing and remanufacturing require both common and separate operations, together with the supplier's operations for the new parts and useful lifetime of the product is modeled as a queuing network. ...
Explaining beer demand: A residual modeling regression approach using statistical process control
Köksalan, Mustafa Murat; Erkip, N; Moskowitz, H (Elsevier BV, 1999-01-25)
We develop a medium-term model as well as a short-term model for understanding the factors affecting beer demand and for forecasting beer demand in Turkey. As part of this specific model development (as well as regression modeling in general) we propose a procedure based on statistical process control principles (SPC) and techniques to (1) detect nonrandom data points, (2) identify common missing, lurking variables that explain these anomalies, and (3) using indicator variables, integrate these lurking vari...
Production and lead time quotation under imperfect shop floor information
KAMAN, Cumhur; Savaşaneril Tüfekci, Seçil; Serin, Yaşar Yasemin (Elsevier BV, 2013-08-01)
We study the value of shop floor information for a manufacturer that operates under a make-to-stock queue scheme and quotes lead times to arriving customers. Two settings are analyzed where in the first setting the manufacturer is able to perfectly track the shop floor status, and in the second setting the manufacturer makes decisions under imperfect information. Under imperfect information, the problem is modeled as a Partially Observable Markov Decision Process. In the computational analysis, first the im...
A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems
Chung, CS; Flynn, J; Kirca, O (Elsevier BV, 2002-10-11)
The m-machine permutation flowshop problem with the total flow-time objective is a common scheduling problem, which is known to be NP-hard for m greater than or equal to 2. In this article, we develop a branch and bound algorithm to solve both the weighted and unweighted version of this problem. Our algorithm incorporates a new machine-based lower bound and a dominance test for pruning nodes. Computational experiments suggest that the algorithm can handle test problems with n less than or equal to 15. It al...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. MERAL and N. ERKIP, “SIMULATION ANALYSIS OF A JIT PRODUCTION LINE,”
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
, pp. 147–156, 1991, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65058.