Authors:
S. Kemmoe
1
;
D. Lamy
2
and
N. Tchernev
2
Affiliations:
1
Université d’Auvergne, France
;
2
LIMOS UMR CNRS 6158, France
Keyword(s):
Supply Chain, Payment Delay, Job-Shop, Linear Program, GRASP.
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Artificial Intelligence
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Linear Programming
;
Methodologies and Technologies
;
Operational Research
;
Optimization
;
Pattern Recognition
;
Scheduling
;
Software Engineering
;
Supply Chain Management
;
Symbolic Systems
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 t
han a second in average.
(More)