Original scientific paper In this research, a new task planning algorithm is developed for building a desired object configuration from a given initial unordered object state. The task of the planning algorithm is to find a feasible set of actions, i.e. a finite number of discrete transformations, which can rearrange the objects into a desired ordered final state. The environment is interpreted...

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...

Continuous approximation is regarded as a scalable and insightful method for acquiring near-optimum solutions to various location problems. A continuous solution nonetheless only density function further discretization procedure needed obtain discrete engineering practice. Inspired by the process of “crystal growth”, this paper proposes constructive heuristic algorithm an alternative classic me...

In this paper we reconsider a “task-swapping” procedure for improving schedules in the face of resource oversubscription. Prior work has demonstrated that use of a retraction heuristic to determine which tasks to rearrange in an existing schedule allows for addition of new tasks which would otherwise fail to be scheduled. The existing task swap procedure employs a variable ordering heuristic fo...

This report addresses an important crossdocking planning operation which is the scheduling of trucks at crossdocking terminals. The study focuses on the problem in a resource-constrained crossdock. The truck scheduling problem in this scenario decides on the succession of incoming and outgoing trucks at the dock doors of the crossdocking terminal, subject to the availability of the crossdock re...

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal soluti...

The workforce scheduling and routing problem (WSRP) is a combinatorial optimisation problem where a set of workers must perform visits to geographically scattered locations. We present a Variable Neighbourhood Search (VNS) metaheuristic algorithm to tackle this problem, incorporating two novel heuristics tailored to the problem-domain. The first heuristic restricts the search space using a prio...

This paper presents a new constructive approach based on simulated annealing for the large scope of scheduling problem can be assumed as traveling salesman problem (TSP). The main contribution of this research is developing a new definition of TSP. We solve the TSP when there are no roads between some cities. This leads us to incomplete graph constructed based on TSP. We demonstrate this realit...

Abstract In cellular mobile communications the subcarriers are repeatedly used for best utilizing the assigned frequency spectrum. The assignment of channels for users is complex and involves high computation time. Wong et al [15] proposed a heuristic algorithm to achieve the suboptimal solution for sub-carrier assignment. This proposal was based on constructive assignment in real time situatio...

This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Minimization Open Stack Problem (MOSP). The MOSP happens in a production system scenario, and consists of determining a sequence of cut patterns that minimizes the maximum number of opened stacks during the cutting process. The CGA has a number of new features compared to a traditional genetic algorithm, as a p...