Modeling and Solving Scheduling Problem with m Uniform Parallel Machines Subject to Unavailability Constraints

The problem investigated in this paper is scheduling on uniform parallel machines, taking into account that machines can be periodically unavailable during the planning horizon. The objective is to determine planning for job processing so that the makespan is minimal. The problem is known to be NP-h...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithms Ročník 12; číslo 12; s. 247
Hlavní autor:	Kaabi, Jihene
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Basel MDPI AG 01.12.2019
Témata:	Algorithms Job shops Linear programming makespan Mathematical models optimal algorithm Preventive maintenance quadratic programming Schedules Scheduling unavailability constraints uniform parallel machines
ISSN:	1999-4893, 1999-4893
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!