Flow shop scheduling problems have a wide range of real-world applications in intelligent manufacturing. Since they are known to be NP-hard for more than two machines, we propose a hybrid genetic simulated annealing (HGSA) algorithm for flow shop sch...
This paper focuses on the flowshop scheduling problem with sequence dependent setup times (FSSP-SDST), which has been an investigated object for decades as one of the most popular scheduling problems in manufacturing systems. A novel hybrid local sea...
This paper presents a historical review and recent developments in mixed graph colorings in the light of scheduling problems with the makespan criterion. A mixed graph contains both a set of arcs and a set of edges. Two types of colorings of the vert...
The No-wait Flowshop Scheduling Problem (NWFSP) has always been a research hotspot because of its importance in various industries. This paper uses a matheuristic approach that combines exact and heuristic algorithms to solve it with the objective to...
Since its creation by Nawaz, Enscore, and Ham in 1983, NEH remains the best heuristic method to solve flowshop scheduling problems. In the large body of literature dealing with the application of this heuristic, it can be clearly noted that results d...
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies an insertion local search t...
We study two-machine shop-scheduling problems provided that lower and upper bounds on durations of n jobs are given before scheduling. An exact value of the job duration remains unknown until completing the job. The objective is to minimize the makes...
This study addresses a two-machine job-shop scheduling problem with fixed lower and upper bounds on the job processing times. An exact value of the job duration remains unknown until completing the job. The objective is to minimize a schedule length...
The integration of scheduling and process planning can eliminate resource conflicts and hence improve the performance of a manufacturing system. However, the focus of most existing works is mainly on the optimization techniques to improve the makespa...
As multi-factory production models are more widespread in modern manufacturing systems, a distributed blocking flowshop scheduling problem (DBFSP) is studied in which no buffer between adjacent machines and setup time constraints are considered. To a...
The goal of manufacturing scheduling is to allocate a set of jobs to the machines in the shop so these jobs are processed according to a given criterion (or set of criteria). Such criteria are based on properties of the jobs to be scheduled (e.g., th...
As a typical non-deterministic polynomial (NP)-hard combinatorial optimization problem, the hybrid flow shop scheduling problem (HFSSP) is known to be a very common layout in real-life manufacturing scenarios. Even though many metaheuristic approache...
The permutation flow-shop scheduling problem is a classical problem in scheduling that aims at identifying the optimal sequence of jobs that should be processed in a number of machines in an effort to minimize makespan or some other performance crite...
Based on the non-permutation property of intercell scheduling in flowline manufacturing cells, a hybrid harmony search algorithm is proposed to solve the problem with the makespan criterion. On the basis of the basic harmony search algorithm, the thr...
Operating room (OR) scheduling problems are often addressed using deterministic models that assume surgery durations are known in advance. However, such assumptions fail to reflect the uncertainty that often occurs in real surgical environments, espe...
Steelmaking and the continuous-casting (SCC) scheduling problem is a realistic hybrid flow shop scheduling problem with continuous-casting production at the last stage. This study considers the SCC scheduling problem with diverse products, which is a...
This work focuses on the study of robust no-wait flow shop scheduling problem (R-NWFSP) under the interval-valued fuzzy processing time, which aims to minimize the makespan within an upper bound on total completion time. As the uncertainty of actual...
Estimation of distribution algorithms (EDAs) is a subset of evolutionary algorithms widely used in various optimization problems, known for their favorable results. Each generation of EDAs builds a probabilistic model to represent the most promising...
The complexity of unmanned aerial vehicle (UAV) missions is increasing with the rapid development of UAV technology. Multiple UAVs usually cooperate in the form of teams to improve the efficiency of mission execution. The UAVs are equipped with multi...
This paper considers the two parallel-machine scheduling problem with intree-precedence constraints where machines are subject to non-availability constraints. In the literature, this problem is considered to be an open problem of unknown complexity....
With the increasing use of cloud computing by organizations, cloud data centers are proliferating to meet customers’ demands and host various applications using virtual machines installed in physical servers. Through Live Virtual Machine Migrat...
The aim of this paper is to present a model of energy efficient scheduling for series production systems during operation, including setup and shutdown activities. The flow shop system together with setup, shutdown times and energy consumption are co...
Various aspects of task execution load balancing of Internet of Things (IoTs) networks can be optimised using intelligent algorithms provided by software-defined networking (SDN). These load balancing aspects include makespan, energy consumption, and...