E. Balas, Machine Scheduling via Disjunctive Graphs: An Implicit Enumeration Algorithm, 941-957, Operations Research, vol 17, 1969 .  Home/Search   Document Not in Database   Summary   Related Articles   Check

....use of Jackson s Preemptive Schedule for Solving the Job Shop Problem, Annals of Operations Research, vol 26, 269 287. Carlier, J. and Pinson, E. 1994) Adjustment of Heads and Tails for the Job Shop Problem, European Journal of Operational Research, Oct 27, 78(2) 146 161. 232) References Balas, E. 1985) On the Facial Structure of Scheduling Polyhedra, Mathematical Programming Study, vol 24, 179218. Balas, E. Lenstra, J. K. and Vazacopoulos, A. 1995) The One Machine Problem with Delayed Precedence Constraints and its use in Job Shop Scheduling, Management Science, Jan, 41(1) 94 109. ....

....269 287. Carlier, J. and Pinson, E. 1994) Adjustment of Heads and Tails for the Job Shop Problem, European Journal of Operational Research, Oct 27, 78(2) 146 161. 232) References Balas, E. 1985) On the Facial Structure of Scheduling Polyhedra, Mathematical Programming Study, vol 24, 179218. Balas, E. Lenstra, J. K. and Vazacopoulos, A. 1995) The One Machine Problem with Delayed Precedence Constraints and its use in Job Shop Scheduling, Management Science, Jan, 41(1) 94 109. Balas, E. Lancia, G. Serafini, P. and Vazacopoulos, A. 1998) Job Shop Scheduling with Deadlines, Journal of ....

[Article contains additional citation context not shown here]

Balas, E. (1969) Machine Scheduling via Disjunctive Graphs: An Implicit Enumeration Algorithm, Operations Research, vol 17, 941-957.

....but without 03 10 98 Anant Singh Jain . Balasubramanian Rangaswamy . Sheik Meeran page (5) affecting solution quality. A landmark contribution to neighbourhood functions for P J is provided by Van Laarhooven et al. 1992) Their neighbourhood structure, derived from the seminal work of Balas (1969), has laid the foundations for the most effective search strategies currently employed. It consists only of those moves that are achieved by reversing the processing order of an adjacent pair of critical operations that require the same machine. Such a neighbourhood is based on the following ....

Balas, E. (1969) Machine Scheduling via Disjunctive Graphs: An Implicit Enumeration Algorithm, page (22) Job-shop neighbourhoods and move evaluation strategies 03/10/98 Operations Research, vol 17, 941-957.

....of reducing the size of this neighbourhood and guaranteeing feasibility but without affecting solution quality. A landmark contribution to neighbourhood functions for the DJS problem is provided by Van Laarhooven et al. 1988, 1992) Their neighbourhood structure, derived from the seminal work of Balas (1969), has laid the foundations for the most effective search strategies currently employed. It consists only of those moves that are achieved by reversing the processing order of an adjacent pair of critical operations, subject to the condition that these operations must be processed on the same ....

Balas, E. (1969) Machine Scheduling via Disjunctive Graphs: An Implicit Enumeration Algorithm, Operations Research, vol 17, 941-957.

....that most problems are solved optimally. Although this is currently the best NN method for P G the method is highly problem dependent as it requires good initial values. Although the external processor acts as a metastrategy which guides the network, operations are randomly chosen for swapping. Balas (1969) proves that unless the operations are on the critical path swapping will never improve the makespan. Glover (1995) states that a random move selection is highly unproductive. Swapping can also result in non feasible solutions. JAIN AND MEERAN JOB SHOP SCHEDULING USING NEURAL NETWORKS page (11) ....

....subject to the condition they do not vary by more than 20 from any training set example and they result in the same optimum makespan. In order to achieve this during training it is the processing times of non critical operations which are varied, by less than 20 . Based on the work of Balas (1969), Matsuo et al. 1988) and Van Laarhooven et al. 1992) prove varying these operations will not affect the critical path and thus the overall makespan will remain the same. The essential thing is to ensure that by varying the processing time of a non critical operation, it does not become ....

BALAS, E., 1969, Machine scheduling via disjunctive graphs: An implicit enumeration algorithm, Operations Research, 17, 941-957.

....Past, Present and Future 03 10 98 page(4) 2. THE PHASES OF P P J HISTORY THE TECHNIQUES APPLIED Opinion in the P J field is mixed about who first proposed the job shop problem in its current form. Roy and Sussman (1964) were the first to propose the disjunctive graph representation and Balas (1969) was the first to apply an enumerative approach based on the disjunctive graph. Nevertheless there were earlier works in job shop scheduling. Giffler and Thompson (1960) proposed a priority dispatch rule template, Jackson (1956) generalised Johnsons s flow shop algorithm (Johnson 1954) to the ....

....of local search (Johnson et al. 1988; Yannakakis 1990) to P J . In local search methods a metastrategy is able to guide a myopic algorithm to optimality by accepting non improving solutions. The works of Van Laarhooven et al. 1988) and Matsuo et al. 1988) which were derived from Balas (1969), and Grabowski et al. 1988) laid the foundations for powerful P J neighbourhood structures which use local search techniques that are respectively based on the permutation of critical operations and the notion of blocks. The boom period was started by the technique that has had the greatest ....

[Article contains additional citation context not shown here]

Balas, E., (1969), "Machine scheduling via disjunctive graphs: An implicit enumeration algorithm", Operations Research 17, 941-957.

....at an early stage of the search. See the survey of Pinson (1995) for more detail. The BB search technique was initially studied by Brooks and White (1965) Ignall and Schrage (1965) and Lomnicki (1965) Other early work of note includes that of Brown and Lomnicki (1966) and Greenberg (1968) Balas (1969) presents one of the first applications of a BB scheme to P J . This method applies the disjunctive graph model and only considers critical operations. Another early BB algorithm for P J is by Florian et al. 1971) McMahon and Florian (1975) present one of the first successful applications of ....

Balas, E. (1969) Machine Scheduling via Disjunctive Graphs: An Implicit Enumeration Algorithm, Operations Research, vol 17, 941-957.

No context found.

E. Balas, Machine Scheduling via Disjunctive Graphs: An Implicit Enumeration Algorithm, 941-957, Operations Research, vol 17, 1969 .

No context found.

E. Balas. Machine scheduling via disjunctive graphs: An implicit enumeration algorithm. Operations Research, 17:941-957, 1969.

No context found.

E. Balas, Machine Scheduling via Disjunctive Graphs: An Implicit Enumeration Algorithm, 941-957, Operations Research, vol 17, 1969 .

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC