Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness

This paper focuses on the problem of scheduling jobs in a permutation flowshop with the objective of makespan minimisation subject to a maximum allowed tardiness for the jobs, a problem that combines two desirable manufacturing objectives related to machine utilisation and to customer satisfaction....

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 64; s. 86 - 96
Hlavní autori:	Fernandez-Viagas, Victor, Framinan, Jose M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 01.12.2015 Pergamon Press Inc
Predmet:	Algorithms Approximation Bounded insertion Customer satisfaction Flowshop Heuristic Heuristics Job shops Makespan Mathematical models Maximum tardiness NEH Non-population algorithm Operations research Permutations PFSP Production scheduling Scheduling State of the art Studies NEH Maximum tardiness Non-population algorithm Bounded insertion Heuristics PFSP Scheduling Makespan Flowshop
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!