In this paper we study the following generalization of the job-shop scheduling problem which belongs to the hardest problems in combinatorial optimization.Expand

A three-step control methodology using a hierarchical plan is proposed to manage the cooperation between these technologies, focused on domestic energy streams.Expand

We present a polynomial-time approximation scheme (PTAS) for the minimum dominating set problem in unit disk graphs for the case that no geometric representation of the graph is available.Expand

In a flow-shop problem with transportation times and a single robot n jobs consisting of m operations have to be processed in the same order on m machines.Expand

We present an approach that can be used to create polynomial-time approximation schemes for several optimization problems called the local neighborhood-based scheme.Expand

We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot.Expand