This paper takes a game theoretical approach to open shop scheduling problems minimize the sum of completion times. We assume that there is an initial schedule process jobs (consisting number operations) on machines and each job owned by different player. Thus, we can associate cooperative TU-game any problem, assigning coalition maximal cost savings it obtain through admissible rearrangements ...

Many problems in industry are a form of open-shop scheduling problem (OSSP). We describe a hybrid approach to this problem which combines a Genetic Algorithm (GA) with simple heuristic schedule building rules. Excellent performance is found on some benchmark OSS problems, including improvements on previous best-known results. We describe how our approach can be simply amended to deal with the m...

Many problems in industry are a form of open-shop scheduling problem (OSSP). We describe a hybrid approach to this problem which combines a Genetic Algorithm (GA) with simple heuristic schedule building rules. Excellent performance is found on some benchmark OSS problems, including improvements on previous best-known results. We describe how our approach can be simply amended to deal with the m...

this paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. the fuzzy set theory is applied to describe this situation. a novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. due to the computational complexities, the prop...

The problem of maximizing the weighted number of just-in-time jobs in a two-machine ‡ow shop scheduling system is known to be NP-hard [4]. However, the question of whether this problem is strongly or ordinary NP-hard remains an open question. We provide a pseudo-polynomial time algorithm to solve this problem, proving that it is NP-hard in the ordinary sense. Moreover, we show how the pseudo-po...

In the paper we discuss the influence of the route flexibility degree, the open rate of operations and the production type coefficient on makespan. The flexible job-open shop scheduling problem FJOSP (an extension of the classical job shop scheduling) is analyzed. For the analysis of the production process we used a hybrid heuristic of the GRASP (greedy randomized adaptive search procedure) wit...