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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of production research Ročník 62; číslo 3; s. 867 - 890
Hlavní autoři:	Fontes, Dalila B.M.M., Homayouni, Seyed Mahdi, Fernandes, João Chaves
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London Taylor & Francis 01.02.2024 Taylor & Francis LLC
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!