Lot splitting under learning effects with minimal revenue requirements and multiple lot types

Date

2003-08-01

Author

Serin, Yaşar Yasemin

Metadata

Show full item record

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

Item Usage Stats

82
views

0
downloads

The lot splitting problem in the presence of learning is addressed. This work is an extension of an approach proposed for splitting in the case of a single item. We address the issue of a minimal revenue requirement from partial deliveries until a predetermined time. This is achieved by imposing a constraint on what is originally an unconstrained optimization problem. When sublots of different items are involved, the optimal splitting decisions have to be combined with the sequencing of the deliveries. Numerical examples are presented to demonstrate the proposed approach.

Subject Keywords

Delivery of goods, Economic lot size, Manufacturing processes, Industrial engineering

URI

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

Journal

IIE TRANSACTIONS

DOI

https://doi.org/10.1080/07408170390225697

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Parallel-machine rescheduling with machine disruptions Azizoğlu, Meral (Informa UK Limited, 2005-12-01) In this study we consider a rescheduling problem on identical parallel machines. The rescheduling is undertaken because of a period of unavailability on one of the machines. We consider the total flow time as an efficiency measure and stability is gauged in terms of the number of jobs processed on different machines in the original and new schedules. We show that all efficient schedules with respect to efficiency and stability measures can be generated in polynomial time.
Local decision making and decision fusion in hierarchical levels BELDEK, ULAŞ; Leblebicioğlu, Mehmet Kemal (Springer Science and Business Media LLC, 2009-07-01) Hierarchical problem solving is preferred when the problem is overwhelmingly complicated. In such a case, the problem should better be analyzed in hierarchical levels. At each level, some temporary solutions are obtained; then a suitable decision fusion technique is used to merge the temporary solutions for the next level. The hierarchical framework proposed in this study depends on reutilization or elimination of previous level local agents that together perform the decisions due to a decision-fusion techn...
Cross reference models for estimating unknown principal force components in end-milling process Dölen, Melik; Lorenz, RD (Elsevier BV, 2003-01-01) This paper focuses on the problem of estimating the unknown principal cutting force component with the available knowledge on the other component. The paper presents two compact (end-milling) process models. Using these models, two cross-reference models, which explore the functional relationships among the free parameters of these models, are developed. Within the framework of constructing an unknown force component, the estimation performance of the proposed models along with their inherent limitations ar...
Attention mechanisms for semantic few-shot learning Baran, Orhun Buğra; Cinbiş, Ramazan Gökberk; İkizler-Cinbiş, Nazlı; Department of Computer Engineering (2021-9-1) One of the fundamental difficulties in contemporary supervised learning approaches is the dependency on labelled examples. Most state-of-the-art deep architectures, in particular, tend to perform poorly in the absence of large-scale annotated training sets. In many practical problems, however, it is not feasible to construct sufficiently large training sets, especially in problems involving sensitive information or consisting of a large set of fine-grained classes. One of the main topics in machine learning...
Assembly line balancing with multi-manned tasks Esin, Ceyhan Erdem; Kırca, Ömer; Department of Industrial Engineering (2007) In this thesis, we define a new problem area for assembly lines. In the literature, there are various studies on assembly line balancing, but none of them consider multi-manned tasks, task to which at least two operators have to be assigned. Two mathematical models and one constraint programming model are developed for both Type-I and Type-II ALB problems. The objective of Type-I problem is to minimize the number of stations whereas the objective of Type-II problem is to minimize the cycle time. In addition...

Citation Formats

Y. Y. Serin, “Lot splitting under learning effects with minimal revenue requirements and multiple lot types,” IIE TRANSACTIONS, pp. 689–698, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38791.