Complete Characterization of Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem

Abstract

In a two-machine flow shop scheduling problem, the set of approximate sequences (i.e., solutions within a factor 1+ of the optimal) can be mapped to the vertices of a permutation lattice. We introduce two approaches, based on properties derived from the analysis of permutation lattices, for characterizing large sets of near-optimal solutions. In the first… (More)
DOI: 10.1007/978-3-642-29828-8_5

4 Figures and Tables

Topics

  • Presentations referencing similar topics