This paper describes a hybrid tabu search algorithm dedicated to a job shop problem with a no-wait constraint with a makespan criterion. The proposed here algorithm complexity is that the superior algorithm based on the tabu search technique selects parameters controlling the work of a certain constructional algorithm. This approach limits the checked solutions only to a group of solutions bein...

This paper, as well as coupled paper [2], deal with various aspects of scheduling algorithms dedicated for processing in parallel computing environments. In this paper, for the exemplary problem, namely the flow-shop scheduling problem with makespan criterion, there are proposed original methods for parallel analysis of a solution as well as a group of concentrated and/or distributed solutions,...

On the basis of uncertainty theory, plenty of researches have been done on uncertain resource-constrained project scheduling problems. Instead of minimizing the makespan, in this paper, we address the maximization of net present value of a project’s cash flows when activity durations are assumed to be uncertain. In addition to precedence constraint and resource constraint involved in resource-c...

This paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. In the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). However,, two significant criteria for each schedule in stochastic models are: expectable m...

The flowshop problem (FSP) is one of the most thoroughly studied scheduling problems. In the FSP, a set N = {1, . . . , n} of n independent jobs has to be processed on a set M = {1, . . . ,m} of m machines. Every job j, j ∈ N , requires a given fixed, non-negative processing time pij on every machine i, i ∈ M . In a flowshop, all n jobs are to be processed on the m machines in the same order, t...

In this paper the job shop scheduling problem with two criteria of minimizing makespan and the sum of tardiness of jobs is considered. This multi-objective problem is strongly NP-hard, as single criterion version is strongly NP-hard as well. A permutation-based representation for the job shop problem is used and a new hybrid parallel multi-agent method, called GACO (Genetic Algorithm Ant Colony...

In this paper, we present a new linear time algorithm for scheduling uect (Unit Execution and Communication Time) trees on two identical processors: CBoS (clusters based on subtrees). The chosen criterion is the makespan. The used strategy is based on clustering of tasks. We show that this algorithm builds optimal schedules. Some extensions are discussed for non uet tasks. Nous pr esentons un n...

We consider a problem of multi-product lot-sizing and scheduling where each product can be produced by a family of alternative multi-machine technologies. Multi-machine technologies require one or more machine at the same time. A sequence dependent setup time is needed between different technologies. The criterion is to minimize the makespan. Preemptive and non-preemptive versions of the proble...

The critical path method remains one of the most popular approaches in practical scheduling. Being developed for the makespan problem this method can also be generalized to the maximum lateness problem. For the unit execution time task system and parallel processors this generalization is known as the Brucker±Garey±Johnson algorithm. We characterize this algorithm by introducing an upper bound ...