In this paper the resource-constrained flow shop (RCF) problem is addressed. A number of realistic extensions are incorporated, including non-serial precedence requirements, mixed flow shop situations, and the distribution of the human workforce among a number of pre-determined groups. The RCF is then solved by meta-heuristics, primarily of the evolutionary type. An extensive numerical investig...

In this paper, we propose 260 scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. The types of problems that we propose are : the permutation flow shop, the job shop and the open shop scheduling problems. We restrict us to basic problems : the processing times are fixed, there are neither set-up tim...

The paper considers a three-machine shop scheduling problem to minimize the makespan, in which the route of a job should be feasible with respect to a machine precedence digraph with three nodes and one arc. For this NP-hard problem that is related to the classical flow shop and open shop models, we present a simple 1.5approximation algorithm and an improved 1.4-approximation algorithm.

Scheduling problems naturally arise in supply chains, ranging from manufacturing and business levels in a single firm through multi-organizational processes. In these environments, jobs are served by various resources. As scheduling choices are often decentralized, an inferior system solution may occur. In this paper we investigate a decentralized job-shop system, where jobs are processed utili...

The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing a job, the machine has to be adjusted; there is onl...

In this paper we deal with solution algorithms for a general formulation of the job shop problem, called alternative graph. We study in particular the job shop scheduling problem with blocking and/or no-wait constraints. Most of the key properties developed for solving the job shop problem with infinite capacity buffer do not hold in the more general alternative graph model. In this paper we re...

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

We consider the flow shop scheduling problem with minimizing two criteria simultaneously: the total completion time (makespan) and the sum of tardiness of jobs. The problem is strongly NP-hard, since for each separate criteria the problem is strongly NP-hard. There is a number of heuristic algorithms to solve the flow shop problem with various single objectives, but usage of those heuristics to...

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of jobs that visit a set of machines in the same order. The FSP is NP-hard, which means that an efficient algorithm for solving the problem to optimality is unavailable. To meet the requirements on time and to minimize the make-span performance of large permutation flow-shop scheduling problems in which there are sequence dep...