Movement optimization in flow shop processing with buffers

Espelage, Wolfgang; Wanke, Egon

doi:10.1007/s001860000044

Cited by 3 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The present paper is the first to study the exact version of this natural problem, which we find intriguing mainly due to its applications in practice. For further results on this problem, we refer to [EW1]- [EW3] and [Es].…”

Section: Outline and Context Of Our Resultsmentioning

confidence: 99%

“…In Section 5, we study the exact conveyor flow shop problem that we also prove complete for the levels of the boolean hierarchy over NP. The conveyor flow shop problem, which arises in real-world applications in the wholesale business, where warehouses are supplied with goods from a central storehouse, was introduced and intensely studied by Espelage and Wanke [EW00]. The present paper is the first to study the exact version of this natural problem, which we find intriguing mainly due to its applications in practice.…”

Section: |mentioning

confidence: 87%

See 1 more Smart Citation

Complexity of the exact domatic number problem and of the exact conveyor flow shop problem

Riege

Rothe

Proceedings. 2004 International Conference on Information and Communication Technologies: From Theory to Applications, 2004.

View full text Add to dashboard Cite

Abstract. We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of computer networks, is the problem of partitioning a given graph into a maximum number of disjoint dominating sets. This number is called the domatic number of the graph. We prove that the problem of determining whether or not the domatic number of a given graph is exactly one of k given values is complete for BH 2k (NP), the 2kth level of the boolean hierarchy over NP. In particular, for k = 1, it is DP-complete to determine whether or not the domatic number of a given graph equals exactly a given integer. Note that DP = BH 2 (NP). We obtain similar results for the exact versions of generalized dominating set problems and of the conveyor flow shop problem. Our reductions apply Wagner's conditions sufficient to prove hardness for the levels of the boolean hierarchy over NP.

show abstract

Section: Outline and Context Of Our Resultsmentioning

confidence: 99%

Section: |mentioning

confidence: 87%