In this work we study the unrelated parallel machines problem with the objective of the minimization of the maximum completion time or makespan (Cmax). We propose some metaheuristics based on a size-reduction of the original assignment problem. The idea is to consider only a few of the best possible machine assignments for the jobs and not all of them. We test the proposed simple algorithms wit...

This paper presents a quantum-inspired immune algorithm (QIA) for Hybrid flow shop problems (HFSP) to minimize makespan. Since HFSP have been proved to be NP-hard in a strong sense when the objective is to minimize the makespan, an effective immune algorithm (IA) is used to solve the problems. IA is a kind of evolutional computation strategies, which is developed on the basis of a real immune m...

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...

to use services transparently in a distributed environment, the utility grids develop a cyber-infrastructure. the parameters of the quality of service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the utility grids. optimization of both target parameters above is a challenge in a distributed environment and may conflict one ano...

In the classical scheduling problems, it has been assumed that complete knowledge of the problem was available when it was to be solved. However, scheduling problems in the real world face the possibility of the lack of the knowledge. Uncertainties frequently encountered in scheduling environments include the appearance of new jobs and unknown processing times. In this work, we take into accoun...

this article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. the objective is to minimize the makespan for a given set of jobs in the system. this problem class is np-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. a number of test problems are randomly ge...

In this work we give a tight lower bound on makespan approximations for envy-free allocation mechanism dedicated to scheduling tasks on unrelated machines. Specifically, we show that no mechanism exists that can guarantee an envy-free allocation of jobs to m machines with a makespan of less than a factor of O(logm) of the minimal makespan. Combined with previous results, this paper definitively...

Sustainability considerations in manufacturing scheduling, which is traditionally influenced by service oriented performance metrics, have rarely been adopted in the literature. This paper aims to address this gap by incorporating energy consumption as an explicit criterion in shop floor scheduling. Leveraging the variable speed of machining operations leading to different energy consumption le...