Skip to content
Free planNo credit card requiredStart writing

preprint · HAL (Le Centre pour la Communication Scientifique Directe) · 2012

Complete Characterization of $\epsilon$-approximate Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem

Jean‐Charles Billaut, Emmanuel Hébrard, Pierre Lòpez

Cited by 0Open access

Abstract

The index has no abstract for this paper.

Cite this paper

APA 7

Billaut, J., Hébrard, E., & Lòpez, P. (2012). Complete Characterization of $\epsilon$-approximate Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem. HAL (Le Centre pour la Communication Scientifique Directe).

MLA 9

Billaut, Jean‐Charles, et al. “Complete Characterization of $\epsilon$-approximate Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem.” HAL (Le Centre pour la Communication Scientifique Directe), 2012.

Chicago

Billaut, Jean‐Charles, Emmanuel Hébrard, and Pierre Lòpez. 2012. “Complete Characterization of $\epsilon$-approximate Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem.” HAL (Le Centre pour la Communication Scientifique Directe).

Harvard

Billaut, J., Hébrard, E. and Lòpez, P. (2012) ‘Complete Characterization of $\epsilon$-approximate Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem’, HAL (Le Centre pour la Communication Scientifique Directe).

BibTeX
@misc{billaut2012complete,
  title = {{Complete Characterization of $\epsilon$-approximate Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem}},
  author = {Billaut, Jean‐Charles and Hébrard, Emmanuel and Lòpez, Pierre},
  journal = {HAL (Le Centre pour la Communication Scientifique Directe)},
  year = {2012}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.