A note on ''The general lot sizing and scheduling problem''

Date

2005-01-01

Author

Koclar, A
Süral, Haldun

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

106
views

0
downloads

Fleischmann and Meyr (1997) develop a model for the lot sizing problem with sequence dependent setup costs. In this note we show that this model is limited to the case where production state between two consecutive periods is conserved only if the available capacity of the preceding period exceeds the minimum batch quantity. We generalize the model by modification.

Subject Keywords

Management Science and Operations Research

URI

https://hdl.handle.net/11511/40325

Journal

OR SPECTRUM

DOI

https://doi.org/10.1007/s00291-004-0181-7

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM KIRCA, O; KOKTEN, M (Elsevier BV, 1994-06-09) In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planni...
Neural network calibrated stochastic processes: forecasting financial assets Giebel, Stefan; Rainer, Martin (Springer Science and Business Media LLC, 2013-03-01) If a given dynamical process contains an inherently unpredictable component, it may be modeled as a stochastic process. Typical examples from financial markets are the dynamics of prices (e.g. prices of stocks or commodities) or fundamental rates (exchange rates etc.). The unknown future value of the corresponding stochastic process is usually estimated as the expected value under a suitable measure, which may be determined from distribution of past (historical) values. The predictive power of this estimati...
Assessment of criteria - rich rankings for environmental policy making Yeralan, Sencer; Ozdoglar, Mehmet Rasit; Azizoğlu, Meral (Inderscience Publishers, 2011-12-01) This paper illustrates the use of mathematical programming techniques to extract more information out of composite indexes (e.g., the EPI-2008) that would assist decision makers. While recognising the qualitative aspects of such decision making, in order to support and guide the policy making process, we develop analytical tools to assist the process. We carefully delineate our models to be limited only to the provable quantitative properties of the available objective data. However, such data are processed...
On the classical Maki-Thompson rumour model in continuous time Belen, Selma; Kropat, Erik; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2011-03-01) In this paper, the Maki-Thompson model is slightly refined in continuous time, and a new general solution is obtained for each dynamics of spreading of a rumour. It is derived an equation for the size of a stochastic rumour process in terms of transitions. We give new lower and upper bounds for the proportion of total ignorants who never learned a rumour and the proportion of total stiflers who either forget the rumour or cease to spread the rumour when the rumour process stops, under general initial condit...
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.

Citation Formats

A. Koclar and H. Süral, “A note on ″The general lot sizing and scheduling problem″,” OR SPECTRUM, pp. 145–146, 2005, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40325.