although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

Multicommodity distribution problem is one of the most interesting and useful models in mathematical programming due to its major role in distribution networks. The purpose of this paper is to describe and solve a special class of multicommodity distribution problems in which shipment of a commodity from a plant to a customer would go through different distribution centers. The problem is t...

The supply chain network design not only assists organizations production process (e.g.,plan, control and execute a product’s flow) but also ensure what is the growing need for companies in a longterm. This paper develops a three-echelon supply chain network problem including multiple plants, multiple distributors, and multiple retailers with amulti-mode demand satisfaction policy inside of pro...

A backpacker approaches a road with a marker on it, desirous of finding the marker but having only a rough idea of where it is located. It is well known among backpackers that it is best to aim either right or left of the marker, since otherwise it will not be clear which way to turn upon reaching the road. The problem of deciding exactly where to aim can be formalized as a modification of the ...

We consider the following combinatorial search problem: we are given some excellent elements of [n] and we should find at least one, asking questions of the following type: ”Is there an excellent element in A ⊂ [n]?”. G.O.H. Katona [6] proved sharp results for the number of questions needed to ask in the adaptive, non-adaptive and two-round versions of this problem. We verify a conjecture of Ka...