We introduce a new technique for solving several sequencing problems. We consider Gilmore and Gomory’s variant of the Traveling Salesman Problem and two variants of no-wait flowshop scheduling, the classical makespan minimization problem and a new problem arising in the multistage production process in steel manufacturing. Our technique is based on an intuitive interpretation of sequencing prob...

This paper considers the relocation problem arising from public re-development projects cast as a two-machine flowshop scheduling problem. In such a project, some buildings need to be torn down and re-constructed. The two processes of tearing down and re-constructing each building are often viewed as a single operation. However, under certain circumstances, the re-construction process, i.e., th...

The flowshop scheduling problems with n jobs processed on two or three machines, and with two jobs processed on k machines are addressed where jobs have random and bounded processing times. The probability distributions of random processing times are unknown, and only the lower and upper bounds of processing times are given before scheduling. In such cases, there may not exist a unique schedule...

This paper presents an improved artificial bee colony (IABC) algorithm for solving the blocking flowshop problem with the objective of minimizing makespan. The proposed IABC algorithm utilizes discrete job permutations to represent solutions and applies insert and swap operators to generate new solutions for the employed and onlooker bees. The differential evolution algorithm is employed to obt...

Scheduling in chemical flowshops is one of a number of important industrial problems which are potentially amenable to solution using the genetic algorithm. However the problem is not trivial: flowshops run continuously, and for efficient operation those controlling them must be able to adjust the order in which products are made as new requests are received. In addition, there are in principle...

This paper investigates an approach to the permutation flowshop scheduling problem based on Tabu Search with an additional memory structure called a ‘pruning pattern list’. The pruning pattern list approach allows a better use of the critical block information. A solution of the flowshop scheduling problem is represented by a permutation of job numbers. A pruning pattern is generated from a sol...

This research deals with a flexible flowshop scheduling problem with arrival and delivery of jobs in groups and processing them individually. Due to the special characteristics of each job, only a subset of machines in each stage is eligible to process that job. The objective function deals with minimization of sum of the completion time of groups on one hand and minimization of sum of the diff...

Studies on scheduling with learning considerations have recently become important. Most studies focus on single-machine settings. However, numerous complex industrial problems can be modeled as flowshop scheduling problems. This paper thus focuses on minimizing the makespan in an m-machine permutation flowshop with learning considerations. This paper proposes a dominance theorem and a lower bou...

One of the most important assumptions in production scheduling is that the machines are permanently available without any breakdown. In the real world of scheduling, machines can be made unavailable due to various reasons such as preventive maintenance and unpredicted breakdown. In this paper, we explore flowshop configuration under the assumption of condition-based maintenance to minimize expe...

Machine scheduling problems arise in many production processes, and are something that needs to be consider when optimizing the supply chain. Among them, flowshop happen a number of jobs have sequentially processed by machines. This paper addressees, for first time, Permutation Flowshop Scheduling problem with additional Resources during Setups (PFSR-S). In this problem, addition standard permu...