On the complexity of short-term production planning and the near-optimality of a sequential assignment problem heuristic approach

2013 ◽  
Vol 65 (4) ◽  
pp. 537-543 ◽  
Author(s):  
Adar Kalir ◽  
Yonatan Zorea ◽  
Adir Pridor ◽  
Lev Bregman
Keyword(s):  
Production Planning ◽  
Assignment Problem ◽  
Heuristic Approach ◽  
Sequential Assignment ◽  
Short Term ◽  
Near Optimality

Rekonfiguration von Produktionsnetzwerken*/Planning of reconfigurable production networks

2018 ◽  
Vol 108 (03) ◽  
pp. 137-142
Author(s):  
J. Atug ◽  
S. Braunreuther ◽  
G. Reinhart
Keyword(s):  
Production Planning ◽  
Wird Eine ◽  
Production Networks ◽  
Short Term ◽  
Delivery Times ◽  
Future Production ◽  
Planning Approach ◽  
High Adherence ◽  
Demand Volatility ◽  
Increasing Demand

Starke Nachfrageschwankungen insbesondere in der auftragsbezogenen Produktion sowie die Forderung nach kürzeren Lieferzeiten und höherer Termintreue führen zu erhöhten Anforderungen an die zukünftige Produktion. Um diesen Anforderungen gerecht zu werden, bedarf es dynamischer Produktionsnetzwerke. In diesem Fachbeitrag wird eine Methode zur kurzfristigen Anpassung von Produktionsnetzwerken durch Rekonfiguration in der auftragsbezogenen Produktion vorgestellt.   Increasing demand volatility in order-based production as well as the need of shorter delivery times and high adherence to schedules leads to high requirements of the future production. To meet these essential requirements dynamic production networks are needed. In this technical contribution a production planning approach of short-term reconfiguration of production networks in the order-based production is given.

scholarly journals Limiting Behavior of the Target-Dependent Stochastic Sequential Assignment Problem

2014 ◽  
Vol 51 (4) ◽  
pp. 943-953 ◽  
Author(s):  
Golshid Baharian ◽  
Sheldon H. Jacobson
Keyword(s):  
Distribution Function ◽  
Markov Chain ◽  
Assignment Problem ◽  
Sequential Assignment ◽  
Threshold Probability ◽  
Limiting Behavior ◽  
Target Value ◽  
Long Run ◽  
Stochastic Parameters ◽  
Optimal Policies

The stochastic sequential assignment problem assigns distinct workers to sequentially arriving tasks with stochastic parameters. In this paper the assignments are performed so as to minimize the threshold probability, which is the probability of the long-run reward per task failing to achieve a target value (threshold). As the number of tasks approaches infinity, the problem is studied for independent and identically distributed (i.i.d.) tasks with a known distribution function and also for tasks that are derived from r distinct unobservable distributions (governed by a Markov chain). Stationary optimal policies are presented, which simultaneously minimize the threshold probability and achieve the optimal long-run expected reward per task.

Sign in / Sign up

Export Citation Format

Share Document