Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. We consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. We modify the concept of cost over time (COVERT) for the generalized version of the flow shop tardiness model and employ this concept for developing four algorithms....

We investigate the multiprocessor multi stage open shop scheduling problem In this variant of the open shop model there are s stages each consisting of a number of parallel identical machines Each job consists of s operations one for each stage that can be executed in any order The goal is to nd a non preemptive schedule that minimizes the makespan We derive two approximation results for this N...

a three stage production system is considered in this paper. there are two stages to fabricate and ready the parts and an assembly stage to assembly the parts and complete the products in this system. suppose that a number of products of different kinds are ordered. each product is assembled with a set of several parts. at first the parts are produced in the first stage with parallel machines a...

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.

This paper considers a two-stage hybrid flow shop scheduling problem. The objective is the minimizing of maximum completion time of all the jobs. There exist two dedicated machines at stage 1 and one machine at stage 2. Each job is defined by two operations processed on the two-stages in series. Depending on the job type, the job is processed on either of the two machines at stage1 and must be ...

In this paper, scheduling problems in Flexible Manufacturing Cells (FMC) are studied. The scheduling objective is to minimize the makespan. We used a genetic algorithm (GA) for solving the optimization scheduling problem. We have developed one FMC with industrial characteristics with the objective of studying scheduling problems in these types of manufacturing systems (single machine scheduling...

Media Directory; Cabell’s Directories; Compendex (Elsevier Engineering Index); DBLP; GetCited; Google Scholar; INSPEC; JournalTOCs; MediaFinder; Norwegian Social Science Data Services (NSD); SCOPUS; The Index of Information Systems Journals; The Standard Periodical Directory; Ulrich’s Periodicals Directory Copyright The International Journal of Decision Support System Technology (IJDSST) (ISSN ...