Publications without Fulltext
Permanent URI for this collectionhttps://hdl.handle.net/20.500.14288/3
Browse
29 results
Search Results
Publication Metadata only Syndicated lending under asymmetric creditor information - Correction(Elsevier, 1996) Cadot, O; Department of Business Administration; Banerjee, Saugata; Researcher; Department of Business Administration; College of Administrative Sciences and Economics; N/AThis paper explores how asymmetric information about borrower quality among syndicated lenders alters the incentive to refinance illiquid borrowers. We use a model in which lenders enter the market sequentially in two rounds of lending. Between the two rounds, a shock separates borrowers into good ones and bad ones, and early entrants acquire information about individual borrower type, while late entrants know only the distribution of borrower types. The asymmetric information structure gives rise to both signalling and screening issues. We show that self-selecting contracts do not exist, and that there is always a pooling Perfect Bayesian Equilibrium in which late entrants lend to both good and bad types, without borrower type being exposed before final clearing at the terminal time. Based on this framework, we argue that prior to the 1982 international debt crisis, it was possible for banks with heavy exposure to troubled debtors to attract rational newcomers in syndicated loans which were, with positive probability, bailout loans.Publication Metadata only Finite-capacity scheduling-based planning for revenue-based capacity management(Elsevier Science Bv, 1997) Department of Business Administration; Akkan, Can; Faculty Member; Department of Business Administration; College of Administrative Sciences and Economics; N/AFinite-capacity scheduling can be argued to be a crucial component of revenue-based capacity management. In that case, one way to plan production is to reserve portions of capacity for incoming customer orders as they arrive, in real-time. In such a planning method, the way these work-orders are scheduled affects the useable capacity, due to fragmentation of the time-line. Assuming the work-orders are rejected if they cannot be inserted into the existing schedule, we develop heuristics to minimise the present-value of the cost of rejecting orders and inventory holding cost due to early completion. We perform simulation experiments to compare the performance of these heuristics in addition to some common heuristics used in practice.Publication Metadata only Strategic context of organizational market information processes within the multinational corporation(amer Marketing assoc, 1996) Department of Business Administration; N/A; Gençtürk, Esra; Faculty Member; N/A; Department of Business Administration; College of Administrative Sciences and Economics; N/A; N/A; N/AN/APublication Metadata only Analysis of multistation production systems with limited buffer capacity part:2 the decomposition method(Pergamon-Elsevier Science Ltd, 1997) Yeralan, S.; Department of Business Administration; Tan, Barış; Faculty Member; Department of Business Administration; College of Administrative Sciences and Economics; 28600We seek efficient techniques to evaluate the performance of multistation production systems with limited interstation buffers and station breakdown. Our ultimate objective is to develop a practical computer implementation that can be used for analysis and design. A flexible decomposition framework is developed. This approach allows the analysis of multistation production systems with various structures including series arrangements, network topologies, and rework (feedback) systems. The efficient solution techniques for the subsystems developed in Part 1 are used at each iteration of the decomposition method. It is the generality and efficiency of the subsystem model as well as the flexibility and robustness of the decomposition approach that distinguish our study from earlier work.Publication Metadata only Overtime scheduling: an application in finite-capacity real-time scheduling(Taylor & Francis, 1996) Department of Business Administration; Akkan, Can; Faculty Member; Department of Business Administration; College of Administrative Sciences and Economics; N/ANegotiating and meeting due-times for work-orders is often the most important concern of managers of manufacturing systems. We propose a new approach called overtime scheduling that determines on which work-centres, when and how much overtime is required to meet a requested due-time with minimum overtime cost. This method would be used as a part of a finite-capacity real-time scheduling and planning system. We propose a work-order insertion based approach, where a new work-order is scheduled without substantially changing the schedule of previously scheduled work-orders. Based on this approach, we characterise the solution space and present experimental results on the performances of several heuristics.Publication Metadata only Syndicated lending under asymmetric creditor information(Elsevier, 1996) Cadot, O; Department of Business Administration; Banerjee, Saugata; Researcher; Department of Business Administration; College of Administrative Sciences and Economics; N/AThis paper explores how asymmetric information about borrower quality among syndicated lenders alters the incentive to refinance illiquid borrowers. We use a model in which lenders enter the market sequentially in two rounds of lending. Between the two rounds, a shock separates borrowers into good ones and bad ones, and early entrants acquire information about individual borrower type, while late entrants know only the distribution of borrower types. The asymmetric information structure gives rise to both signalling and screening issues. We show that self-selecting contracts do not exist, and that there is always a pooling Perfect Bayesian Equilibrium in which late entrants lend to both good and bad types, without borrower type being exposed before final clearing at the terminal time. Based on this framework, we argue that prior to the 1982 international debt crisis, it was possible for banks with heavy exposure to troubled debtors to attract rational newcomers in syndicated loans which were, with positive probability, bailout loans.Publication Metadata only Cyclic scheduling in flow lines: modeling observations, effective heuristics and a cycle time minimization procedure(Wiley-Blackwell, 1996) Kouvelis, Panagiotis; Department of Business Administration; Karabatı, Selçuk; Faculty Member; Department of Business Administration; College of Administrative Sciences and Economics; 38819In this paper we address the cyclic scheduling problem in flow lines. We develop a modeling framework and an integer programming formulation of the problem. We subsequently present exact and approximate solution procedures. The exact solution procedure is a branch-and-bound algorithm which uses Lagrangian and station-based relaxations of the integer programming formulation of the problem as the lower bounding method. Our heuristic procedures show a performance superior to the available ones in the literature. Finally, we address the stability issue in cyclic scheduling, demonstrate its relationship to the work-in-progress inventory control of a flow line, and present a very simple procedure to generate stable schedules in flow linesPublication Metadata only A station model for continuous materials flow production systems(Taylor & Francis, 1997) Yeralan, S; Department of Business Administration; Tan, Barış; Faculty Member; Department of Business Administration; College of Administrative Sciences and Economics; 28600This study develops a station model for continuous flow production systems. The most prominent use of the model is as a building block for a general and flexible decomposition method to analyse and design continuous materials flow production systems. Station breakdown and a finite capacity buffer are considered. Station inference caused by the blocking and starving phenomena is included in the station model. We assume that the time to station breakdown and station repair are exponentially distributed while the buffer is neither empty nor full. No restrictive assumptions are made about the distributions of the station breakdown and repair times when the station is blocked or starved, that is, while the buffer remains empty or remains full. The production rate and the expected level of the buffer are given in closed form. Numerical results that show the effects of the input parameters on the production rate along with an overview of the decomposition methods are presented.Publication Metadata only Agile manufacturing and management of variability(Wiley-Blackwell, 1998) Department of Business Administration; Tan, Barış; Faculty Member; Department of Business Administration; College of Administrative Sciences and Economics; 28600In this study, the relationship between agile manufacturing and management of variability is discussed. First, the key concepts of agility and agile manufacturing are introduced. These key concepts are then related to the management of variability. Previous studies on the modeling of variability of manufacturing systems are reviewed. Then the effects of variability of the structure of the production system, and also the processing time variability on the performance of a manufacturing system are studied by utilizing a simple model of a synchronous production line with identical stations and random processing times. Numerical results that examine the effects of the coefficient of variation of service time and the number of stations on the variability of the cycle time are also given.Publication Metadata only A bicriteria approach to the two-machine flow shop scheduling problem(Elsevier Science Bv, 1999) N/A; Department of Business Administration; Department of Business Administration; Sayın, Serpil; Karabatı, Selçuk; Faculty Member; Faculty Member; Department of Business Administration; College of Administrative Sciences and Economics; College of Administrative Sciences and Economics; 6755; 38819In this paper we address the problem of minimizing makespan and sum of completion times simultaneously in a two-machine flow shop environment. We formulate the problem as a bicriteria scheduling problem, and develop a branch-and-bound procedure that iteratively solves restricted single objective scheduling problems until the set of efficient solutions is completely enumerated. We report computational results, and explore certain properties of the set of efficient solutions. We then discuss their implications for the Decision Maker.
- «
- 1 (current)
- 2
- 3
- »