A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort. An algorithm is also developed to minimize the required number...

The paper investigates newsvendor problem for a dyadic supply chain in which both the supplier and the retailer are concerned with fairness. Nash bargaining solution is introduced as the fairness reference point and equilibrium results are derived. The effects of fairness concerns on optimal...