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

Storage or buffer capacities between successive machines in flowshop problems may be unlimited, limited or null. Two last cases can lead to blocking situations. In flowshop scheduling literature, many studies and research were realized about classical flowshop problem and also about some problems with only one blocking situation. This paper deals with makespan minimization in flowshop schedulin...

Integrated scheduling of distributed manufacturing operations has implications for supply chain optimization and requires further investigations to facilitate its application area various industry settings. This study extends the limited literature two-stage production-assembly problems offering a twofold contribution. First, an original mathematical extension, Distributed Two-Stage Assembly Fl...

In the field of scheduling, the flowshop problems have been thoroughly studied over the last six decades. In this paper we propose a concise overview of flowshop scheduling techniques evolved during this period. We surveyed the exact, heuristics and metaheuristics methods for solving various flowshop scheduling problems. As a result various optimization techniques, solution procedures are avail...

The most general flowshop scheduling problem is also addressed in the literature as nonpermutation flowshop (NPFS). Current processors are able to cope with the (n!) m combinatorial complexity of non-permutation flowshop scheduling by metaheuristics. After briefly discussing the requirements for a manufacturing layout to be designed and modeled as non-permutation flowshop, a disjunctive graph (...

Scheduling in a permutation flowshop refers to processing of jobs set available machines the same order. Among several possible performance characteristics flowshop, makespan remains one highest preferred metrics by researchers past six decades. The constructive heuristic proposed Nawaz-Enscore-Ham (NEH) is best for minimization. essentially depends on initial ordering according particular prio...

Abstract System-wide optimization of distributed manufacturing operations enables process improvement beyond the standalone and individual optimality norms. This study addresses production planning a system consisting three stages: parts (subcomponents), assembly components in Original Equipment Manufacturer (OEM) factories, final products at product manufacturer’s factory. Distributed Three St...

We consider flowshop environments that consist of multiple stages and multiple machines in each stage. The flowshops are flexible in the sense that a task within a stage can be processed by any of the machines in the stage. We refer to this design as the hybrid flowshop. Our objective is to schedule a set of n jobs so as to minimize makespan. The problem is NP-complete even in the case of a sin...

In this paper, we propose different local search algorithms to solve a realistic variant of the flowshop problem. The variant considered here is a hybrid flexible flowshop problem with sequence-dependent setup times, and with the objective of minimizing the total tardiness. In this variant of flowshop, stage skipping might occur, i.e., not all stages must be visited by all jobs. This scheduling...