On the combinatorial structure of the permutation flow shop problem
Copyright policy )On the combinatorial structure of the permutation flow shop problem
A set of jobs has to be processed on a finite set of machines in identical order. The maximum completion time has to be minimized. The algorithm of Johnson determines the optimal solution for problems with only two machines. The maximum completion time is computed via the critical path in a corresponding network. The author considers special neighbourhood structures in order to search a better job order. He calculates the mean cardinality of these neighbourhoods.
Combinatorial optimization, Deterministic scheduling theory in operations research, local search, neighbourhood structures, Programming involving graphs or networks, flow shop, maximum completion time
Combinatorial optimization, Deterministic scheduling theory in operations research, local search, neighbourhood structures, Programming involving graphs or networks, flow shop, maximum completion time
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!