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

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 c...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of intelligent manufacturing Jg. 27; H. 2; S. 297 - 313
Hauptverfasser:	Fazel Zarandi, M. H., Khorshidian, H., Akbarpour Shirazi, M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2016 Springer Nature B.V
Schlagworte:	Advanced manufacturing technologies Business and Management Chains Compatibility Control Docking Experiments Genetic algorithms Integer programming Just in time Logistics Machines Management Manufacturing Mathematical models Mechatronics Multiple criterion Nonlinearity Processes Production Production scheduling Robotics Scheduling Studies Supply chain management Trucks Just-in-time scheduling Preemption Constraint satisfaction problem Genetic algorithm Cross-docking system
ISSN:	0956-5515, 1572-8145
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!