A tabu search algorithm for the Open Shop problem

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1997 English Publisher:Springer Science and Business Media LLCJournal:Top, volume 5, pages 283-296 (issn: 1134-5764, eissn: 1863-8279,

Copyright policy )

Authors: Alcaide, David; Sicilia, Joaquín; Vigo, Daniele;

doi: 10.1007/bf02568554

A tabu search algorithm for the Open Shop problem

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

University of La Laguna
Spain
Alma Mater Studiorum University of Bologna
Italy

Keywords

arbitrary number of machines, Deterministic scheduling theory in operations research, tabu search, Integer programming, sequencing, minimum makespan open shop problem without preemption

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).	16
	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).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average