The paper considers the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machine at the second stage. At the first stage, jobs use some additional renewable resources which are available in limited quantities. The resource requirements are of 0-1 type. The objective is minimization of the makespan. The problem is NP-hard. ...

We study the following problem. Given a multiset $M$ of non-negative integers, decide whether there exist and, in positive case, compute two non-trivial multisets whose Minkowski sum is equal to $M$. The A and B containing all possible sums any element B. This problem was proved be NP-complete when are replaced by sets. version strictly related factorization boolean polynomials that turns out a...

Motivated by a connection with the factorization of multivariable polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral polygons is NP-complete then present a pseudo-polynomial time algorithm for decomposing polygons. For higher dimensional polytopes, we give a heuristic algori...

We consider the problem of decomposing audio into components that have different time frequency characteristics. For this, we model the components using different transforms and mixed norms. While recent works concentrate on the synthesis prior formulation, we consider both the analysis and synthesis prior formulations. We derive algorithms for both formulations through a primal-dual framework....

the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...

⎯There have been many studies on two-stage supply models. Because supply chains are increasingly more complicated, this study considers the three-stage supply chain configurations which involve multiple companies at each stage and each company at the upstream stages can supply two or more customers. The coordination mechanisms for the members along the chain are achieved in the following two as...

RMC (Ready-mixed concrete) vehicle scheduling problem is a complex combinatorial optimization problem with intersection of several research areas, such as logistics, just-in-time production and supply chains etc. We integrates RMC production scheduling and vehicle dispatch problems in the same framework by network flow techniques and establishes a mixed integer programming model for ready-mixed...

J.M. Kurtzherg proposed a method of obtaining approximate solutions to the assignment problem by decomposing a large problem into many smaller subproblems. Thus a km × km assignment problem is decomposed into k 2 problems of size m × m and one prt~blem of size k × k. In this paper we analyze the performance of this heuristic, obtaining the following main results: It) For the maximization proble...

In this paper we address a scheduling problem taken from a label sticker manufacturing company. The production system is a two-stage hybrid flow shop with the characteristics of sequence-dependent setup time at stage 1, dedicated machines at stage 2, and two due dates. The objective is to schedule one day’s mix of label stickers through the shop such that the weighted maximal tardiness is minim...

Performance Data envelopment analysis Managerial efficiency Profitability efficiency A two-stage approach in data envelopment analysis (2S-DEA) methodology is used towards decomposing a typical two-stage operation process of general insurance companies, which is conducted in a single operation involving intermediate. Specifically, we evaluate the managerial efficiency and profitability efficien...