Improved upper bounds for permutation flowshop scheduling benchmarks (Taillard and VRF)

{"references": ["E. Taillard, Flow shop sequencing: Summary of best known lower and upper bounds of Taillard's instances, http://mistic.heig-vd.ch/taillard/problemes.dir/ordonnancement.dir/flowshop.dir/best_lb_up.txt", "E. Vallada, R. Ruiz and J.M. Framinan, New hard benchmark for flowshop scheduling problems minimising makespan, EJOR 2015, https://doi.org/10.1016/j.ejor.2014.07.033"]}

Optimal makespans and permutation schedules (found and proven optimal by Branch-and-Bound) for Taillard instances Ta112, Ta116 (500 jobs, 20 machines) and 74 instances of the VRF benchmark.

Related Organizations

University of Lille
France
French National Centre for Scientific Research
France
University of Mons
Belgium

Keywords

Permutation Flowshop Scheduling Problem

Impact byBIP!

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