Job Shop Scheduling with Consideration of Due Dates

Potentials of Local Search Based Solution Techniques

  • Jens Kuhpfahl

Part of the Produktion und Logistik book series (PL)

Table of contents

  1. Front Matter
    Pages i-xxv
  2. Jens Kuhpfahl
    Pages 1-8
  3. Jens Kuhpfahl
    Pages 25-30
  4. Jens Kuhpfahl
    Pages 31-64
  5. Jens Kuhpfahl
    Pages 119-146
  6. Back Matter
    Pages 147-190

About this book


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.


Job Shop Scheduling – Formulation und Modelling

Neighborhood Definitions for the JSPTWT

Neighbor Evaluation Procedures

Solving the JSPTWT – a new Solution Procedure

Target Groups

  • Researchers and students focusing on machine scheduling, operative production planning and control, as well as the development of powerful solution procedures
  • Practitioners in these areas

The Author

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


JSPTWT Machine Scheduling Neighbour Evaluation Procedures Operative Production Planning Powerful Solution Procedures

Authors and affiliations

  • Jens Kuhpfahl
    • 1
  1. 1.Lehrstuhl für Produktion und LogistikUniversität Halle-WittenbergHalleGermany

Bibliographic information