Purpose: This paper examines the behaviour of shared and dedicated Kanban allocation policies of Hybrid Kanban-CONWIP and Basestock-Kanban-CONWIP control strategies in multi-product systems; with considerations to robustness of optimal solutions to environmental and system variabilities....

Purpose: We aim to examine the capacitated multi-item lot sizing problem which is a typical example of a large bucket model, where many different items can be produced on the same machine in one time period. We propose a new approach to determine the production sequence and lot sizes that...

This contribution summarizes recent work in the field of lot sizing and scheduling. The objective is not to give a comprehensive literature survey, but to explain differences of formal models and to provide some first readings recommendations. Our focus is on capacitated, dynamic, and...

Choosing right Rapid Prototyping technology is not easy, especially for companies inexperienced with that group of manufacturing techniques. Paper summarizes research focused on creating an algorithm for expert system, helping to choose optimal process and determine its parameters for...

We are interested in obtaining rates of production of intermediate parts and finished products in a manufacturing system consisiting of a network of machines. The objective is to meet demand for finished products at the minimum possible total discounted cost of production, inventories, and...

This paper is concerned with explicit optimal control for a deterministic manufacturing system consisting of a single reliable machine and producing two part types studied by Connolly (Master Thesis, Operations Research Center, MIT, Cmbridge, 1992) and Gershwin (Manufacturing Systems...

This paper evaluates the performance of the Hybrid Kanban Constant Work-In-Process control strategy and Basestock Kanban Constant Work-In-Process control strategy operating Shared Kanban Allocation Policy (S-KAP) and Dedicated Kanban Allocation Policy (D-KAP) in a multi-product serial flow line....

This contribution deals with dynamic, capacitated, multi-level lot sizing and scheduling. The basic assumption is that for each item there is exactly one machine that this item can be manufactured on but no two items share a common machine. Finding an optimal solution with a greedy algorithm...