Venkata Prasad Palakiti

9 Questions 44 Answers 0 Followers

Questions related from Venkata Prasad Palakiti

What are the best crossdocking tools available in market to handle operations smoothly in warehouse?

Looking for crossdocking tools for handling operations in warehouse. If any knows please share your view on this. I appreciate your support on this.

12 May 2016 4,642 3 View

Is it possible to quote multiple prices to the customers in the same segment?

A firm is producing multiple products, based on the past data firm can segment the customers. Is it possible to offer multiple prices to every customer in the same segment?

23 May 2015 4,080 4 View

How to download twitter data?

Hello all, I am working on project. I want to download twitter data. By using twitter API, I am able to download only 3 tweets. Is there a way to download at least 1000 tweets?

11 March 2015 2,423 69 View

How to determine the service level in deterministic multi period inventory problem?

Generally for service level calculations most of the papers used cu/cu+co. I felt it is applicable to only stochastic problems. Can we use this formula for a deterministic problem?

29 May 2014 341 8 View

When should we use 2 partition and 3 partition problems for proving the complexity of scheduling problems?

In literature, for proving the complexity of scheduling problems people use 2 partition and 3 partition problems. Can any one please help me to distinguish these problems for proving the complexity.

29 May 2014 6,889 10 View

How to calculate the service level in multi period deterministic inventory problem?

Can anyone please help me to clarify my doubt in service level calculation.

28 May 2014 812 2 View

Why should we include a dummy job in the parallel machine while formulating a model?

08 January 2014 3,668 2 View

What is the complexity of flowshop machine configuration with an objective of minimizing flowtime?

Flowshop scheduling complexity

30 May 2013 7,632 6 View

Complexity of 0-1 knapsack problem - Can anyone tell me which algorithm can solve it in polynomial time and under which conditions?

0-1 knapsack problem complexity is NP-complete.Which algorithm can solve it in polynomial time and under which conditions?

30 May 2013 7,190 7 View