Abstract
This paper deals with supply chain optimization using the job-shop model where extra flow constraints are included modelizing cash flow exchanges between different supply chain partners including suppliers, retailers and manufacturers. The problem under study called job-shop with financial constraint is defined as a job-shop problem with simultaneous consideration of machine specific resource requirements and financial constraints. Tackling financial considerations permits to consider a proper coordination of production units when optimizing the supply chain planning and cash flows. The main goal is to obtain the smallest duration of a given supply chain operational planning that respects the budget limit of each production unit. We use a disjunctive graph formulation to model both the job-shop problem and cash flow constraints. We also propose a powerful and efficient GRASPxELS procedure as a solution method. The developed approach for supply chain modeling is novel in the sense that the model encompasses specific financial resource per machine i.e. per plant. The method efficiency is evaluated on a set of instances coming from the Laurence’s job-shop instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Artigues, C., Michelon, P., Reusser, S.: Insertion techniques for static and dynamic resource-constrained project scheduling. Eur. J. Oper. Res. 148, 249–267 (2003)
Badell, M., Romero, J., Huertas, R., Puigjaner, L.: Planning, scheduling and budgeting value-added chains. Comput. Chem. Eng. 28, 45–61 (2004)
Badell, M., Romero, M., Puigjaner, L.: Optimal budget and cash flows during retrofitting periods in batch chemical process industries. Int. J. Prod. Econ. 95, 359–372 (2005)
Baumol, W.J.: The transaction demand for cash: an inventory approach. The Q. J. Econ. 66, 545–556 (1952)
Beamon, M.: Supply chain design and analysis: models and methods. Int. J. Prod. Econ. 55, 281–294 (1998)
Bierwirth, C.: A generalized permutation approach to jobshop scheduling with genetic algorithms. OR Spektrum 17, 87–92 (1995)
Caumond, A., Lacomme, P., Tchernev, N.: A memetic algorithm for the job-shop with time-lags. Comput. Oper. Res. 35(7), 2331–2356 (2008)
Conover, V.: Practical Nonparametric Statistics, 3rd edn. Wiley, New York (1999)
Dell’amico, M., Trubian, M.: Applying tabu-search to the job-shop scheduling problem. Ann. Oper. Res. 41, 231–252 (1993)
Elasouni, A.M., Metwally, F.G.: Expanding finance-based scheduling to devise overalloptimized project schedules. J. Constuction Eng. M. 133, 86–90 (2007)
Elmaghraby, A.E., Herroelen, W.S.: The scheduling of activities to maximize the net present value of project. Eur. J. Oper. Res. 49, 35–49 (1990)
Fenies, P., Bertel, S., Roux, O.: Optimal cash flow and operational planning in a company supply chain. Int. J. Comput. Integr. Manuf. 21(4), 440–454 (2008)
Fenies, P., Comelli, M., Tchernev, N.: Combined financial and physical flows evaluation for logistic process and tactical production planning: Application in a company supply chain. Int. J. Prod. Econ. 112(1), 77–95 (2008)
Feo, T.A., Bard, J.: Flight scheduling and maintenance based planning. Manage. Sci. 35(12), 1415–1432 (1989)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6, 109–33 (1995)
Festa, P., Resende, M.G.C.: GRASP: An annotated bibliography. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys on Metaheuristics, pp. 325–367. Kluwer, Dordrecht (2002)
Fiala, P.: Information sharing in supply chains. Omega Int. J. Manage. Sci. 33, 419–423 (2005)
Grabowski, J., Nowichi, E., Zdrzalka, S.: A block approach for single machine scheduling with release dates and due dates. Eur. J. Oper. Res. 26, 278–285 (1986)
Guillen, G., Badell, M., Espuna, A., Puigjaner, L.: Simultaneous optimization of process operations and financial decisions to enhance the integrated planning/scheduling of chemical supply chains. Comput. Chem. Eng. 30(3), 421–436 (2006)
Guillen, G., Badell, M., Puigjaner, L.: A holistic framework for short-term supply chain management integrating production and corporate financial planning. Int. J. Prod. Econ. 106, 288–306 (2007)
Kemmoe, S., Lacomme, P., Tchernev, N., Quilliot, A.: Mathematical Formulation of the supply chain with cash flow per production unit modelled as Job Shop. In: International Conference on Industrial Engineering and Systems Management, France, IESM’11, May 25–27, Metz, France (2011)
Lacomme, P., Kemmoe, S., Quilliot, A.: A disjunctive flow graph representation of rcpsp: a memetic algorithm based framework. Workshop International: Logistique - Transport, pages Sousse, Tunisie, 18–20 Nov. (2007)
Lacomme, P., Larabi, M., Tchernev, N.: Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles. Int. J. Prod. Econ. Doi: 10.1016/j.ijpe.2010.07.012 online first
Nguyen, V., Prins, C., Prodhon, C.: Multi-Start iterated Local search with tabu search list and path relinking for the two-echelon location-routing problem. In: Eng. Appl. Artif. Intel. 25 56–71 (2012)
Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job-shop problem. Manage. Sci. 42(26), 797–813 (1996)
Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: Recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 29–63. Springer, Heidelberg (2005)
Roy, B., Sussmann, B.: Les problèmes d’ordonnancement avec contraintes disjonctives. Note DS no. 9 bis, SEMA, Paris (1964)
Russel, A.R.: A comparison of heuristics for scheduling projects with cash flows and resource restriction. Manage. Sci. 32(10), 1291–1300 (1986)
Russell, A.H.: Cash flows in networks. Manage. Sci. 16, 357–373 (1970)
Sheskin, D.: Handbook of Parametric and Nonparametric Statistical Procedures, 2nd edn. Chapman and Hall/CRC, Boca Raton (2000)
Stadtler, H.: Supply chain management and advanced planning: basics, overview and challenges. Eur. J. Oper. Res. 163(3), 575–588 (2005)
Taghi, S., Najafi, A.A., Niaki, A.: A genetic algorithm for resource investment problem with discounted cash flow. Appl. Mathe. Comput. 183, 1057–1070 (2006)
Ulusoy, G., Cebelli, S.: An equitable approach to the payment scheduling problem in project management. Eur. J. Oper. Res. 127, 262–278 (2000)
Van Laarhoven, P.J.M., Aarts, E.H.L., Lentra, J.K.: Job-shop scheduling by simulated annealing. Oper. Res. 40 113–125 (1992)
Whang, S., Lee, H.L., Padmanahbhan, V.: Information distortion in a supply chain: the bullwhip effect. Manage. Sci. 43(4), 546–558 (1997)
Wolf, S., Merz, P.: Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Lecture Notes in Computer Science, vol. 4771, pp. 1–15. Springer, Berlin (2007)
Acknowledgements
The authors are grateful to the anonymous referees for their helpful comments on a earlier draft of the paper.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kemmoe, S., Lacomme, P., Tchernev, N., Quilliot, A. (2013). A GRASP for Supply Chain Optimization with Financial Constraints per Production Unit. In: Di Gaspero, L., Schaerf, A., Stützle, T. (eds) Advances in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 53. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6322-1_10
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6322-1_10
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-6321-4
Online ISBN: 978-1-4614-6322-1
eBook Packages: Business and EconomicsBusiness and Management (R0)