This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...

Streaming of video and multimedia content has generated a lot of interest, especially with the recent development of mobile devices with multimedia capabilities. However, ubiquitous multimedia systems face many challenges, such as varied and limited network performance and viewing device capabilities. Adaptive streaming systems are frequently used to reconcile these limitations, while also prov...

Video contents, either in form of on-demand streaming (e.g., YouTube [2]) or live-streaming (e.g., Livestream [3]), need to be transcoded (i.e., converted) based on the supported video formats, resolution of the client devices. Since video transcoding is a computationally expensive operation,it is commonly carried out on the client end. Nonetheless, video transcoding consumes a lot of computati...

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

The classical multi-level capacitated lot-sizing problem is often not suitable to correctly capture resource requirements and precedence relations. We tackle this issue by explicitly modeling these two aspects. Two models are presented; one considering batch production and the other one allowing lot-streaming. Comparisons with traditional models demonstrate the capability of the new approach to...

Lot streaming is moving some portion of a process batch ahead to begin a downstream operation. The problem to be considered in this paper is the following: a single job consisting of U units is to be processed on two machines in the given order. Given a fixed number of possible transfer batches between the two machines, the problem is to find the timing and the size of the transfer batches (or,...

This study focuses on solving a special kind of job shop scheduling problem (JSP), where the job value is exponentially deteriorating over time. The current study attempted to find out whether the expected benefits of Lot Streaming (LS) can be found in solving the JSP with the objective of maximizing the total value of the jobs. LS is a process of splitting jobs into smaller sub-jobs such that ...