This paper studies the problem of production scheduling in a company belonging to the apparel industry, where textile labels are manufactured through the process of thermal transfer. The problem is modelled as a flexible flowshop with two stages. The objectives are the maximisation of system productivity (or minimisation of makespan) and the minimisation of the number of production orders with ...

In bakery production, to perform a processing task there might be multiple alternative machines that have the same functionalities. Finding an efficient production schedule is challenging due significant nondeterministic polynomial time (NP)-hardness of problem when number products, tasks, and are higher. addition, many tasks performed manually as small medium-size bakeries not fully automated....

This paper presents an extended classification for non-permutation flowshops. The versatile options which occur with the possibility of resequencing jobs within the line are considered. The literature review shows that no classification exists which considers extensively this type of flowshop.

In this paper, we address the problem of two-machine flowshop scheduling problem with sequence independent setup times to minimize the total completion time. We propose five new polynomial lower bounds. Computational results based on randomly generated data show that our proposed lower bounds consistently outperform those of the literature.

A hybrid sliding level Taguchi-based particle swarm optimization (HSLTPSO) algorithm is proposed for solving multi-objective flowshop scheduling problems (FSPs). The proposed HSLTPSO integrates particle swarm optimization, sliding level Taguchi-based crossover, and elitist preservation strategy. The novel contribution of the proposed HSLTPSO is the use of a PSO to explore the optimal feasible r...

We investigate the problem of scheduling n jobs in s-stage hybrid flowshops with parallel identical machines at each stage. The objective is to find a schedule that minimizes the sum of weighted completion times of the jobs. This problem has been proven to be NP-hard. In this paper, an integer programming formulation is constructed for the problem. A new Lagrangian relaxation algorithm is prese...

This paper presents an effective evolutionary hybrid for solving the permutation flowshop scheduling problem. Based on a memetic algorithm, the procedure uses a construction component that generates initial solutions through the use of a novel reblocking mechanism operating according to a biased random sampling technique. This component is aimed at forcing the operations having smaller processi...

Traditional scheduling problems with the batch processing machines (BPM) assume that machines are continuously available, and no time is needed for their preventive maintenance (PM). In this paper, we study a realistic variant of flowshop scheduling which integrates flow shop batch processing machines (FBPM) and preventive maintenance for minimizing the makespan. In order to tackle the given pr...

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...