In this paper, the problem of finding an assignment “n” surgeries to be presented in one “m” identical operating rooms (ORs) or machines as surgical case scheduling (SCSP) is proposed. Since ORs are among NP-hard optimization problems, mathematical and metaheuristic methods address OR problems used. The job operation ordering any a permanent part all sequencing problems. transportation times be...

Only two branch-and-bound methods have been published so far for the Open-Shop problem. The best one has been proposed by Brucker et al. But some square problems from size 7 are still unsolved by it. We present an improving technique for branch-and-bound methods applied to Brucker et al. algorithm for Open-Shop problems. Our technique is based on intelligent backtracking. Intelligent backtracki...

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...

The minimization of makespan in open shop with time lags has been to be shown NP-hard the strong sense even for case two machines and unit-time operations. total completion time, however, remained that though it weighted or jobs release dates. This note shows operations is which answers long standing question.

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...

The partially-concurrent open shop scheduling problem is presented. The standard open shop scheduling problem is generalized by allowing some operations to be processed concurrently. This generalization is directly motivated from a real-life timetabling project of assigning technicians to airplanes in an airplane garage. A schedule for the partially-concurrent problem is represented by a digrap...