An Evolutionary Variable Neighbourhood Search for the Unrelated Parallel Machine Scheduling Problem

This article addresses a challenging industrial problem known as the unrelated parallel machine scheduling problem (UPMSP) with sequence-dependent setup times. In UPMSP, we have a set of machines and a group of jobs. The goal is to find the optimal way to schedule jobs for execution by one of the se...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE access 2021, Vol.9, p.42857-42867
Hauptverfasser:	Abdullah, Salwani, Turky, Ayad, Ahmad Nazri, Mohd Zakree, Sabar, Nasser R.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Benchmark testing Crossovers Evolutionary algorithms genetic algorithm Heuristic algorithms Heuristic methods Job shop scheduling Job shops local search algorithm Machine scheduling problem Mutation Optimization Schedules Scheduling Search algorithms Setup times Space exploration Switches
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!