The majority of scheduling research assumes setup as negligible or part of the processing
time. While this assumption simplifies the analysis and/or reflects certain applications, it …

Intelligent scheduling covers various tools and techniques for successfully and efficiently
solving the scheduling problems. In this paper, we provide a survey of intelligent scheduling …

For a dynamic traveling salesman problem (DTSP), the weights (or traveling times) between
two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms …

In this work a genetic algorithm is presented for the unrelated parallel machine scheduling
problem in which machine and job sequence dependent setup times are considered. The …

In this paper, we consider the problem of scheduling aircraft (plane) landings at an airport.
This problem is one of deciding a landing time for each plane such that each plane lands …

This paper reviews the literature related to the class of scheduling problems that involve
sequence-dependent setup times (costs), an important consideration in many practical …

To reduce delay in ship operations in automated container terminals, it is important to make
different types of container handling equipment to operate harmoniously during this …

The problem addressed in this paper is the non-preemptive unrelated parallel machine
scheduling problem with the objective of minimizing the makespan. Machine-dependent and …

This paper addresses the non-preemptive unrelated parallel machine scheduling problem
with machine-dependent and sequence-dependent setup times. All jobs are available at …

This article addresses a multi-stage flow shop scheduling problem with unrelated parallel
machines. Some practical processing restrictions such as independent setup and …