This paper addresses a three-machine assembly-type flowshop scheduling problem, which frequently arises from manufacturing process management as well as from supply chain management. Machines one and two are arranged in parallel for producing component parts individually, and machine three is an assembly line arranged as the second-stage of a flowshop for processing the component parts in batch...

This paper addresses the study of a linkage network of biserial queues linked to a common server with a multistage flowshop scheduling system having ‘m’ machines or servers in series under fuzzy environment. Waiting lines or queues are commonly occurred both in everyday life and in a variety of business and industrial situations. Also, the flowshop scheduling is an important task when a number ...

In recent years, a large number of heuristics have been proposed for the minimization of the total or mean flowtime/completion time of the well-known permutation flowshop scheduling problem. Although some literature reviews and comparisons have been made, they do not include the latest available heuristics and results are hard to compare as no common benchmarks and computing platforms have been...

To have a quality multimedia presentation through networks, its presentation lag needs to be controlled. One way to reduce the lag is to prefetch the media objects before their due dates. This paper explores techniques for optimizing the object sequence in a prefetch-enabled TV-like presentation. An optimal solution is the one with which the presentation lag is minimized. We formulate the probl...

We study flowshop scheduling problems with respect to slack due window assignments, which are operations in jobs assigned an individual window. We combine learning effect and controllable processing times, the has a two-machine no-wait setup. The goal is determine job sequence, based on common flow allowance, size, resource allocation. provide bicriteria analysis fo...

Objective: In this paper, a conceptual framework for integrating production scheduling in flowshop manufacturing cells, known as group (FSGSP), and unequal-area facility layout (UAFLP) decisions is proposed. Materials Methods: First, brief literature review carried out to identify the elements, solution techniques complementary UAFLP, FSGSP layout-scheduling approaches. Results: Based on result...

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...