Lotstreaming with Equal Sublots in No-wait Flowshops
نویسندگان
چکیده
We consider the problem of minimizing makespan in a no-wait flow-shop with an arbitrary number of machines. We assume that all sublots have the same number of items. We consider the cases with or without loading times. In both cases we show the existence of a critical machine which never remains idle. Then we get a set of general conditions on the processing times and loading times, which bind the number of sublots and the rank of the critical machine. © .
منابع مشابه
Lot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
متن کاملA simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem Published in 2015 in the International Transactions in Operational Research Vol. 22, 669-691
Recent studies have demonstrated that the performance of a simulated annealing algorithm can be improved by following multiple search paths and parallel computation. In this paper, we use these strategies to solve a comprehensive mathematical model for a flexible flowshop lot streaming problem. In flexible flowshop environment, a number of jobs will be processed in several consecutive productio...
متن کاملAlgorithms for no-wait flowshops with total completion time subject to makespan
The m-machine no-wait flowshop scheduling problem, with the objective of minimizing total completion time subject to the constraint that makespan has to be less than or equal to a certain value, is addressed in this paper. First, an algorithm is proposed to find an upper bound on the makespan in case the upper bound is not given or unknown. Given the upper bound on makespan, a proposed algorith...
متن کاملMinimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots so that successive operations can be overlapped in a multi-stage production system. This paper presents a procedure for minimizing the mean weighted absolute deviation from due dates when jobs are scheduled in a lot-streaming #ow shop. This performance criterion has been shown to be non-regular and requires a...
متن کاملSimulation analysis of lot streaming in job shops with transportation queue disciplines
In this paper we study a multi-product lot streaming problem in a stochastic job shop with equal and discrete sublots. The problem involves splitting order quantities of different products into different number of equal sublots (NES) and analyzing the effects of sublot-related transportation queue disciplines (TRQD) for different performance measures. Our simulation results show that some combi...
متن کامل