A note on the paper ‘Demonstrating Johnson’s algorithm via resource constrained scheduling’

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/111059

Title:	A note on the paper ‘Demonstrating Johnson’s algorithm via resource constrained scheduling’
Author:	Companys Pascual, Ramón; Ribas Vila, Immaculada
Other authors:	Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses; Universitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
Abstract:	In this paper we demonstrate that the relation between two jobs defined by min{ai, bj}=min{bi, aj}, used in Johnson’s theorem, is not transitive. However, both the theorem and Johnson’s algorithm are correct.
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Economia i organització d'empreses -Algorithm -Flow shop -scheduling -makespan -Johnson’s theorem -transitivity -Algorismes -Màquines automàtiques -- Models matemàtics
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Submitted version Article
Published by:	Taylor & Francis
Share: