A constraint programming model for the scheduling of JIT cross-docking systems with preemption

作者：Zarandi M H Fazel^*; Khorshidian H; Shirazi M Akbarpour

来源：Journal of Intelligent Manufacturing, 2016, 27(2): 297-313.

DOI：10.1007/s10845-013-0860-9

• Cross-docking system
• Just-in-time scheduling
• Preemption
• Constraint satisfaction problem
• Genetic algorithm

In this paper, a scheduling problem of minimizing the total of the earliness, tardiness and the number of preemption for the outbound trucks on a cross-dock system is considered. This problem, which is known to be NP-hard, is compatible with the concepts of just-in-time (JIT) production and supply chain management. A new multi-criteria model, with non-linear terms and integer variables, which cannot be solved efficiently for large sized problems, is proposed. This paper also shows how to map a JIT cross-dock model to a constraint satisfaction problem (CSP) and integer programming (IP). To solve the model for real size applications, a genetic algorithm (GA) is applied. Finally, a computational experiment is carried out to analyze the performances of CSP, GA and IP models with respect to modeling capability, solution quality and time.

• 出版日期2016-4