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...

In the process industry, both quality and consistency of mid-term planning and short-term scheduling are crucial. We propose a sequential approach consisting in three steps : planning, lot streaming-pegging, and scheduling. This paper focuses on the intermediate problem that consists in cutting up the planned production in several lots (lot streaming) and linking stocks, lots and demands by det...

This paper presents a hybrid metaheuristic for solving the lot streaming problem in job shop production systems. In contrast with conventional tabu search implementations, where the disjunctive graph is adopted to represent the scheduling problem, our tabu search approach is based on permutation with repetition. Moreover, a specific procedure inspired by genetic algorithms is incorporated to se...

Peer-to-Peer (P2P) media streaming networks, motivated by the huge success of P2P file downloading networks, have recently attracted a lot of research interest. However, it is challenging to design P2P media streaming networks because of the stringent time constraints on the delivered media streams, which require more efficient and resilient overlay architectures. In this paper, we focus on liv...

At present, any industry that wanted to be considered a vanguard must willing improve itself, developing innovative techniques generate competitive advantage against its direct competitors. Hence, many methods are employed optimize production processes, such as Lot Streaming, which consists of partitioning the productive lots into overlapping small batches reduce overall operating times known M...