|
![]() |
|||
|
||||
OverviewJens Kuhpfahl analyzes the job shop scheduling problem with minimizing the total weighted tardiness as objective. First, he provides a suitable graph representation based on a disjunctive graph formulation. Second, several key components of local search procedures are analyzed and enhanced. The resulting outputs of these investigations contribute to the development of a new solution procedure whose performance quality leads to superior computational results. Full Product DetailsAuthor: Jens KuhpfahlPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer Gabler Edition: 2016 ed. Dimensions: Width: 14.80cm , Height: 1.30cm , Length: 21.00cm Weight: 2.853kg ISBN: 9783658102913ISBN 10: 3658102918 Pages: 190 Publication Date: 08 July 2015 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of ContentsJob Shop Scheduling – Formulation und Modelling.- Neighborhood Definitions for the JSPTWT.- Neighbor Evaluation Procedures.-Solving the JSPTWT – a new Solution Procedure.ReviewsAuthor InformationDr. Jens Kuhpfahl wrote his dissertation under the supervision of Prof. Dr. Christian Bierwirth at the Chair of Production and Logistics at the University of Halle (Saale). Tab Content 6Author Website:Countries AvailableAll regions |