Energy-efficient job shop scheduling problem with transport resources considering speed adjustable resources

This work extends the energy-efficient job shop scheduling problem with transport resources by considering speed adjustable resources of two types, namely: the machines where the jobs are processed on and the vehicles that transport the jobs around the shop-floor. Therefore, the problem being consid...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of production research Jg. 62; H. 3; S. 867 - 890
Hauptverfasser:	Fontes, Dalila B.M.M., Homayouni, Seyed Mahdi, Fernandes, João Chaves
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London Taylor & Francis 01.02.2024 Taylor & Francis LLC
Schlagworte:	BRKGA Complexity Energy consumption energy-efficient Genetic algorithms Integer programming Job shop scheduling Job shop scheduling problem Job shops Linear programming Mixed integer mixed integer linear programming model multi-population Pareto optimum Resource scheduling Tradeoffs transport resources Vehicles
ISSN:	0020-7543, 1366-588X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!