In this paper we develop a tabu search-based solution procedure designed specifically for a certain class of single-machine scheduling problems with a non-regular performance measure. The performance of the developed algorithm is tested for solving the variance minimization problem. Problems from the literature are used to test the performance of the algorithm. This algorithm can be used for solving other problems such as minimizing completion time deviation from a common due date. References
Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling pr...
The Additive Manufacturing (AM) scheduling problem is becoming a very felt issue not only by the sch...
In this paper we study the following generalization of the job-shop scheduling problem. Each operati...
In this paper we develop a tabu search-based solution procedure designed speci"cally for a ...
In this paper we develop a tabu search-based solution procedure designed specifically for a certain ...
A single machine scheduling problem with distinct due windows to minimize total weighted earliness a...
The present work considers the reduction of the mean completion time and the makespan in the single ...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
This paper presents a tabu search approach for scheduling jobs on identical parallel machines with t...
In this research, a single batch machine scheduling problem with sequence dependent setup time is st...
This paper addresses a single machine scheduling problem with release dates, deadlines, setup costs ...
This paper presents an Optimised Search Heuristic that combines a tabu search method with the verifi...
Real-time task scheduling problems are generally considered to be NP-hard problems. Therefore it is ...
International audienceThe problem that we consider in this article is a flexible job shop scheduling...
This work addresses the permutation flowshop scheduling problem with the objective of minimizing tot...
Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling pr...
The Additive Manufacturing (AM) scheduling problem is becoming a very felt issue not only by the sch...
In this paper we study the following generalization of the job-shop scheduling problem. Each operati...
In this paper we develop a tabu search-based solution procedure designed speci"cally for a ...
In this paper we develop a tabu search-based solution procedure designed specifically for a certain ...
A single machine scheduling problem with distinct due windows to minimize total weighted earliness a...
The present work considers the reduction of the mean completion time and the makespan in the single ...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
This paper presents a tabu search approach for scheduling jobs on identical parallel machines with t...
In this research, a single batch machine scheduling problem with sequence dependent setup time is st...
This paper addresses a single machine scheduling problem with release dates, deadlines, setup costs ...
This paper presents an Optimised Search Heuristic that combines a tabu search method with the verifi...
Real-time task scheduling problems are generally considered to be NP-hard problems. Therefore it is ...
International audienceThe problem that we consider in this article is a flexible job shop scheduling...
This work addresses the permutation flowshop scheduling problem with the objective of minimizing tot...
Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling pr...
The Additive Manufacturing (AM) scheduling problem is becoming a very felt issue not only by the sch...
In this paper we study the following generalization of the job-shop scheduling problem. Each operati...
Add to ORKG