In this paper, we study the problem of minimizing the maximum total completion time per machine on m parallel and identical machines. We prove that the problem is strongly NP-hard if m is a part of the input. When m is a given number, a pseudo-polynomial time dynamic programming is proposed. We...

This paper considers the scheduling problems with the objective of minimizing the total completion time on two parallel identical machines with given unavailable periods. The jobs are assumed to be nonresumable. If there is one unavailable period on one of the two machines, we prove that SPT has...

In this paper, we investigate the capacitated two-parallel machines scheduling problem, where one machine is only available for a special period of time after which it can no longer process any job while the other machine is continuously available. Our objective is to minimize the completion...

This paper considers a parallel-machine scheduling problem with machine maintenance. There are unavailable periods on each of the first k machines, and the remaining m - k machines are always available, where 1 [less-than-or-equals, slant] k [less-than-or-equals, slant] m is an...

In this paper, we consider a selfish bin packing problem, where each item is a selfish player and wants to minimize its cost. In our new model, if there are k items packed in the same bin, then each item pays a cost 1/k, where k ≥ 1. First we find a Nash Equilibrium (NE) in time O(n log n)...

The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [M. Gerber, D. Kobler,...

The process of designing new industrial products is in many cases solely based on the intuition and experience of the responsible design engineer. The aid of computers is restricted to visualization and manual manipulation tools. We demonstrate that the design process for conduits, which are...