We consider a scheduling problem in which the processing time of each job deteriorates, i.e. it increases as time passes after the release date of the job. We present a dynamic programming algorithm coupled with upper bounding and lower bounding techniques to compute exact solutions. We report...

This paper presents the results of the application of the modified Hopfield network to the travelling salesman problem (TSP). A cost function of the TSP consists of four components: two terms which ensure that the salesman's tour is valid, the term which forces neurons to have the output signal...

Assembly line balancing problems (ALBP) consist of distributing the total workload for manufacturing any unit of the products to be assembled among the work stations along a manufacturing line as used in the automotive or the electronics industries. Usually, it is assumed in research papers...

This paper recognizes that individuals working in the nonprofit sector can have different motives and investigates which type of manager nonprofit organizations should best employ. It first considers a situation in which the manager is allowed to attract only one employee and later extends the...

We consider the finite-horizon discrete-time economic order quantity problem. Kovalev and Ng (2008) have developed a solution approach for solving this problem. Their approach requires a search for the optimal number of orders, which takes O(logn) time. In this note, we present a modified...