An Optimization Approach for Job-shop with Financial Constraints - In the Context of Supply Chain Scheduling Considering Payment Delay between Members

S. Kemmoe, D. Lamy, N. Tchernev

2015

Abstract

In this paper the use of Job-Shop Scheduling Problem (JSSP) is addressed as a support for a supply chain scheduling considering financial exchange between different supply chain partners. The financial exchange is considered as the cash flow exchanges between different upstream and downstream partners. Moreover, several suppliers are involved in operations. The problem under study can be viewed as an extension of the classical JSSP. Machines are considered as business or logistic units with their own treasury and financial exchanges happen between the different partners. The goal then is to propose the best schedule considering initial cash flows in treasuries as given data. The problem is formulated as integer linear programming model, and then a powerful GRASPxELS algorithm is developed to solve large scale instances of the problem. The experiments on instances with financial constraints proved the methods addressed the problem efficiently in a short amount of time, which is less than a second in average.

References

  1. Bertel, S., Féniès, P., and Roux, O., 2008. Optimal cash flow and operational planning in a company supply chain. International Journal of Computer Integrated Manufacturing, 21(4), 440-454.
  2. Bierwirth, C. 1995. A generalized permutation approach to Job-shop scheduling with genetic algorithms. OR spektrum, 17, 87-92.
  3. Comelli M., Féniès, P., and Tchernev, N., 2008. Combined financial and physical flows evaluation for logistic process and tactical production planning: Application in a company supply chain. International Journal of Production Economics, 112(1), 77-95.
  4. Elazouni, A. and Gab-Allah, A., 2004. Finance-based scheduling of construction projects using integer programming, Journal of Construction Engineering and Management ASCE 130 (1), pp. 15-24.
  5. Elmaghraby, A. E., and Herroelen, W. S., 1990. The scheduling of activities to maximize the net present value of project. European Journal of Operational Research, 49, 35-49.
  6. Feo T. A., Resende M. G. C., Smith S. H., A greedy randomized adaptive search procedure for maximum independent set. Operations Research 1994;42: 860- 878.
  7. Gormley, F. M., and Meade, N., 2007. The utility of cash flow forecasts in the management of corporate cash balances. European Journal of Operational Research 182, 923-935.
  8. Grosse-Ruyken, P. T., Wagner, S. M., and Jönke, R., 2011. What is the right cash conversion cycle for your supply chain. Int. J. Services and Operations Management 10, 13-29.
  9. Jain, S., Meeran, S., 1999: Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research 113, 390-434.
  10. Kemmoe, S., Lacomme, P., Tchernev, N., and Quilliot, A., 2011a. Mathematical formulation of the Supply Chain with cash flow per production unit modelled as jobshop. IESM, May 25-27, Metz, France, 93-102, ISBN. 978-2-29600532-3-4.
  11. Kemmoe, S., Lacomme, P., Tchernev, N., and Quilliot, A., 2011b. A GRASP for supply chain optimization with financial constraints per production unit, MIC, July 25-28, Udine, Italy.
  12. Kemmoe, S., Lacomme, P., Tchernev, N., 2012. Application of job-shop model for supply chain optimization considering payment delay between members. ILS, August 26-29, Quebec (Canada).
  13. Najafi, A. A., Taghi, S., and Niaki, A., 2006. A genetic algorithm for resource investment problem with discounted cash flow. Applied Mathematics and Computation, 183:1057-1070.
  14. Prins, C., 2009. A GRASP x evolutionary local search hybrid for the vehicle routing problem. In: Pereira FB, Tavares J, editors. Bio-inspired algorithms for the vehicle routing problem, Studies in computational intelligence, 161, 35-53.
  15. Roy, B., Sussmann, B., 1964. Les problèmes d'ordonnancement avec contraintes disjonctives. Note DS no. 9 bis, SEMA, Paris.
  16. Russell, A. R., 1986. A comparison of heuristics for scheduling projects with cash flows and resource restriction. Management Science, 32(10):1291-1300.
  17. Stadtler, H., 2005. Supply chain management and advanced planning--basics, overview and challenges, European Journal of Operational Research, 163(3), 575-588.
  18. Tsai, C. Y., 2008. On supply chain cash flow risks. Decision Support Systems 44, 1031-1042.
  19. Ulusoy, G., and Cebelli, S., 2000. An equitable approach to the payment scheduling problem in project management. European Journal of Operational Research, 127,262-278.
  20. Van Laarhoven, P. J. M., Aarts, E. H. L. and Lenstra, J. K., 1992: Job-shop scheduling by simulated annealing; Operations Research; 40(1), 113-125.
  21. Wolf, S., Merz, P., 2007. Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Lecture notes in computer science. Berlin: Springer, 4771, 1-15.
Download


Paper Citation


in Harvard Style

Kemmoe S., Lamy D. and Tchernev N. (2015). An Optimization Approach for Job-shop with Financial Constraints - In the Context of Supply Chain Scheduling Considering Payment Delay between Members . In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 190-198. DOI: 10.5220/0005271301900198


in Bibtex Style

@conference{icores15,
author={S. Kemmoe and D. Lamy and N. Tchernev},
title={An Optimization Approach for Job-shop with Financial Constraints - In the Context of Supply Chain Scheduling Considering Payment Delay between Members},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={190-198},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005271301900198},
isbn={978-989-758-075-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - An Optimization Approach for Job-shop with Financial Constraints - In the Context of Supply Chain Scheduling Considering Payment Delay between Members
SN - 978-989-758-075-8
AU - Kemmoe S.
AU - Lamy D.
AU - Tchernev N.
PY - 2015
SP - 190
EP - 198
DO - 10.5220/0005271301900198