In this study, we proposed a discrete teaching-learning-based optimisation (DTLBO) for solving the flowshop rescheduling problem. Five types of disruption events, namely machine breakdown, new job arrival, cancellation of jobs, job processing variation and job release variation, are considered simultaneously. The proposed algorithm aims to minimise two objectives, i.e., the maximal completion t...

We consider the mid-term production planning problem in make-to-order production, which consists in scheduling production orders so that the variability in the resource utilization over time is minimized. The problem is modeled as a resource leveling project scheduling problem, where production orders for final products and main components correspond to activities of a project. We present a ne...

The linear ordering problem with cumulative costs (LOPCC) is a variant of the well-known linear ordering problem, in which a cumulative propagation makes the objective function highly non-linear. The LOPCC has been recently introduced in the context of mobile-phone telecommunications. In this paper we propose two metaheuristic methods for this NP-hard problem. The first one is based on the GRAS...

in this paper by combining caching and replication techniques proposed a hybrid heuristic method based on the greedy algorithm to use the benefit of each other techniques. the algorithm in each interaction compares all the contents and one that made the best benefit value is selected for replication. the hybrid approach tested in a simulation environment and the results show that hybrid algorit...

An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...

Abstract Distributed hybrid flow shop scheduling problem (DHFSP) has attracted some attention; however, DHFSP with uncertainty and energy-related element is seldom studied. In this paper, distributed energy-efficient (DEHFSP) fuzzy processing time considered a cooperated shuffled frog-leaping algorithm (CSFLA) presented to optimize makespan, total agreement index energy consumption simultaneous...

Many heuristic algorithms have been proposed for graph coloring. The simplest is perhaps the greedy algorithm. Many variations have been proposed for this algorithm at various levels of sophistication, but it is generally assumed that the coloring will occur in a single attempt. We note that if a new permutation of the vertices is chosen which respects the independent sets of a previous colorin...

Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated ...