Job Shop Scheduling with Consideration of Due Dates

Potentials of Local Search Based Solution Techniques
2016
ISBN: 978-3-658-10291-3
Verlag: Springer

Buch, Englisch, 190 Seiten, Book, Format (B × H): 148 mm x 210 mm, Gewicht: 2853 g

Reihe: Produktion und Logistik

Jens 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.

Zielgruppe

Research

Autoren/Hrsg.

Kuhpfahl, Jens

Fachgebiete

• Wirtschaftswissenschaften Betriebswirtschaft Unternehmensforschung
• Wirtschaftswissenschaften Betriebswirtschaft Bereichsspezifisches Management Produktionsmanagement, Qualitätskontrolle

Inhaltsverzeichnis

Job Shop Scheduling – Formulation und Modelling.- Neighborhood Definitions for the JSPTWT.- Neighbor Evaluation Procedures.-Solving the JSPTWT – a new Solution Procedure.

Über Autor(innen)

Dr. 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).