Card-based delivery date promising in pure flow shops with order release control
نویسندگان
چکیده
منابع مشابه
Orders Loading and Release in Flow Shops including Outsourcing Networks
Purpose of this paper is to analyse and compare the behavior of workload control models in flow shops of both the MTO (Make-To-Order) and MTS (Make-To-Stock) classes. A simulation model has been built, where a manufacturing cell is loaded through an input control mechanism with shop orders coming from a “pool”. The “pool” itself is fed with planned orders coming from an MRP system. The MRP syst...
متن کاملScheduling Flow - Shops with Limited Buffer Spaces
The work described in this paper attempts to validate the implicit assumption in traditional flow shop scheduling research that there is a buffer of infinite capacity between any two adjacent machines. The modified NEH (Nawaz, Encore and Ham) algorithm is used to generate an initial permutation schedule which is then improved by tabu search. For any given sequence, a limited equal buffer size i...
متن کاملApplying machine based decomposition in 2-machine flow shops
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedure where a series of One Machine Sequencing Problems (OMSPs) are solved. However, such a procedure has been reported to be highly ineffective for the Flow Shop problems (Jain and Meeran 2002). In particular, we show th...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملEconomic Lot Sizing and Scheduling in Distributed Permutation Flow Shops
This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Research
سال: 2016
ISSN: 0020-7543,1366-588X
DOI: 10.1080/00207543.2016.1177672