Algorithm 45. A heuristic algorithm for the traveling-salesman problem
Algorithm 49. An algorithm for solving the machine sequencing problem
Algorithm 66. An algorithm for solving the machine sequencing problem with parallel machines
Computational experiments with some approximation algorithms for the travelling salesman problem
One-machine sequencing with release dates, delivery times and precedence constraints
An algorithm for solving a certain sequencing problem
The authors consider the problem of nonpreemptive scheduling of n tasks in a general job shop. The objective is to find a schedule of minimum length. The algorithm presented in the paper is based on the disjunctive graph approach. Its performance is not compared with other algorithms constructed for that problem.
A sequencing problem for optimal job processing by the turning-lathe.
The paper is dealing with a computer-aided system for a turning-lathe machine. It. is divided into two parts. The first one considers the sequencing problem for a job processing by the machine. It describes the problem and then presents a mathematical model and an algorithm for the minimalization of a processing time. We also prove that the pro-blem is NP-hard. The second part, on the other side, considers the problem of the tool replacement by the tnrning-lathe. An algorithm for finding an optimal...
Page 1