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

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 64; pp. 86 - 96
Main Authors:	Fernandez-Viagas, Victor, Framinan, Jose M.
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.12.2015 Pergamon Press Inc
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!