Coverart for item
The Resource Job shop scheduling with consideration of due dates : potentials of local search based solution techniques, Jens Kuhpfahl ; foreword by Christian Bierwith, (electronic book)

Job shop scheduling with consideration of due dates : potentials of local search based solution techniques, Jens Kuhpfahl ; foreword by Christian Bierwith, (electronic book)

Label
Job shop scheduling with consideration of due dates : potentials of local search based solution techniques
Title
Job shop scheduling with consideration of due dates
Title remainder
potentials of local search based solution techniques
Statement of responsibility
Jens Kuhpfahl ; foreword by Christian Bierwith
Creator
Contributor
Author
Subject
Language
eng
Summary
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
Member of
Cataloging source
N$T
http://library.link/vocab/creatorName
Kuhpfahl, Jens
Dewey number
658.5/3
Index
no index present
LC call number
TS157.5
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Bierwith, Christian
Series statement
  • Research
  • Produktion und Logistik
http://library.link/vocab/subjectName
  • Production scheduling
  • Industrial efficiency
  • Economics
  • Operations research
http://bibfra.me/vocab/relation/writerofforeword
QMwTktQCil0
Label
Job shop scheduling with consideration of due dates : potentials of local search based solution techniques, Jens Kuhpfahl ; foreword by Christian Bierwith, (electronic book)
Instantiates
Publication
Note
"Dissertation University of Halle (Saale), 2015."
Antecedent source
unknown
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Foreword; Acknowlegdement; Contents; List of Figures; List of Tables; List of Notations; List of Abbreviations; Chapter 1 Introduction; 1.1 Aims and Contributions of the Thesis; 1.2 Overview of the Thesis; 1.3 Publications; Chapter 2 Job Shop Scheduling -- Formulation and Modeling; 2.1 Problem Structure; 2.2 Classification into the Scheduling Theory; 2.3 Mathematical Model and Complexity; 2.4 The Disjunctive Graph Model; 2.5 The Concept of the Critical Tree; 2.6 Exemplification on the instance ft06 (f = 1.3); Chapter 3 Literature Review; 3.1 Exact Algorithms; 3.2 Dispatching Rules
  • 3.3 Shifting Bottleneck Heuristic3.4 Local Search based Algorithms and Techniques; 3.5 Other Heuristic Approaches; 3.6 Hybrid Approaches; 3.7 Summary; Chapter 4 Neighborhood Definitions for the JSPTWT; 4.1 The Basic Concept of Neighborhood Search; 4.2 Existing Neighborhoods; 4.3 New Neighborhoods; 4.4 Characteristics of the proposed Neighborhoods; 4.4.1 Feasibility Property; 4.4.2 Connectivity Property; 4.4.3 Estimate of the Size of the Neighborhoods; 4.5 Performance Analysis; 4.5.1 Test Suite; 4.5.2 Local Search with a Single Neighborhood Operator
  • 4.5.3 Local Search with Pairs of Neighborhood Operators4.5.4 Local Search with all Neighborhood Operators; 4.6 Summary; Chapter 5 Neighbor Evaluation Procedures in Local Search based Algorithms for solving the JSPTWT; 5.1 Basic Principles; 5.2 A Lower Bound Procedure for the Applica-tion of the CET Neighborhood; 5.3 A Lower Bound Procedure for the Applica-tion of the SCEI Neighborhood; 5.4 A new approach: Heads Updating; 5.5 Performance Test; 5.6 Summary; Chapter 6 Solving the JSPTWT -- a new Solution Procedure; 6.1 Metaheuristic Concepts; 6.1.1 Basic Concept of Metaheuristics
  • 6.1.2 Some Metaheuristics6.1.3 The Fitness Landscape: a brief Side Trip; 6.2 Algorithmic Concept for a new Solution Pro-cedure; 6.2.1 Motivation and Overview of the Algorithmic Concept; 6.2.2 Construction Algorithm; 6.2.3 Improvement Algorithm; 6.2.4 Adaptive Components; 6.2.5 Configuration and Parameter Values; Chapter 7 Computational Study; 7.1 Benchmark Instances of the JSPTWT; 7.1.1 Modification of JSP Instances; 7.1.2 Standard Benchmark Set of Singer and Pinedo; 7.1.3 Lawrence's Instances; 7.2 Other Objective Functions; 7.2.1 JSP with minimizing the Total Flow Time
  • 7.2.2 JSP with minimizing the Number of Tardy Jobs7.3 Summary; Chapter 8 Conclusion; Bibliography; Appendix A Applying Neighborhood Operators: the example ft06 (f = 1.3); Appendix B Overview of considered Dispatching Rules; Appendix C Computational Results from the Literature; Appendix D Analysis of the EGRASP result for the problem instance orb08 (f = 1.6); Appendix E Computational Results for the JSPTWU
Control code
SPR911912004
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783658102913
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-658-10292-0
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
Label
Job shop scheduling with consideration of due dates : potentials of local search based solution techniques, Jens Kuhpfahl ; foreword by Christian Bierwith, (electronic book)
Publication
Note
"Dissertation University of Halle (Saale), 2015."
Antecedent source
unknown
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Foreword; Acknowlegdement; Contents; List of Figures; List of Tables; List of Notations; List of Abbreviations; Chapter 1 Introduction; 1.1 Aims and Contributions of the Thesis; 1.2 Overview of the Thesis; 1.3 Publications; Chapter 2 Job Shop Scheduling -- Formulation and Modeling; 2.1 Problem Structure; 2.2 Classification into the Scheduling Theory; 2.3 Mathematical Model and Complexity; 2.4 The Disjunctive Graph Model; 2.5 The Concept of the Critical Tree; 2.6 Exemplification on the instance ft06 (f = 1.3); Chapter 3 Literature Review; 3.1 Exact Algorithms; 3.2 Dispatching Rules
  • 3.3 Shifting Bottleneck Heuristic3.4 Local Search based Algorithms and Techniques; 3.5 Other Heuristic Approaches; 3.6 Hybrid Approaches; 3.7 Summary; Chapter 4 Neighborhood Definitions for the JSPTWT; 4.1 The Basic Concept of Neighborhood Search; 4.2 Existing Neighborhoods; 4.3 New Neighborhoods; 4.4 Characteristics of the proposed Neighborhoods; 4.4.1 Feasibility Property; 4.4.2 Connectivity Property; 4.4.3 Estimate of the Size of the Neighborhoods; 4.5 Performance Analysis; 4.5.1 Test Suite; 4.5.2 Local Search with a Single Neighborhood Operator
  • 4.5.3 Local Search with Pairs of Neighborhood Operators4.5.4 Local Search with all Neighborhood Operators; 4.6 Summary; Chapter 5 Neighbor Evaluation Procedures in Local Search based Algorithms for solving the JSPTWT; 5.1 Basic Principles; 5.2 A Lower Bound Procedure for the Applica-tion of the CET Neighborhood; 5.3 A Lower Bound Procedure for the Applica-tion of the SCEI Neighborhood; 5.4 A new approach: Heads Updating; 5.5 Performance Test; 5.6 Summary; Chapter 6 Solving the JSPTWT -- a new Solution Procedure; 6.1 Metaheuristic Concepts; 6.1.1 Basic Concept of Metaheuristics
  • 6.1.2 Some Metaheuristics6.1.3 The Fitness Landscape: a brief Side Trip; 6.2 Algorithmic Concept for a new Solution Pro-cedure; 6.2.1 Motivation and Overview of the Algorithmic Concept; 6.2.2 Construction Algorithm; 6.2.3 Improvement Algorithm; 6.2.4 Adaptive Components; 6.2.5 Configuration and Parameter Values; Chapter 7 Computational Study; 7.1 Benchmark Instances of the JSPTWT; 7.1.1 Modification of JSP Instances; 7.1.2 Standard Benchmark Set of Singer and Pinedo; 7.1.3 Lawrence's Instances; 7.2 Other Objective Functions; 7.2.1 JSP with minimizing the Total Flow Time
  • 7.2.2 JSP with minimizing the Number of Tardy Jobs7.3 Summary; Chapter 8 Conclusion; Bibliography; Appendix A Applying Neighborhood Operators: the example ft06 (f = 1.3); Appendix B Overview of considered Dispatching Rules; Appendix C Computational Results from the Literature; Appendix D Analysis of the EGRASP result for the problem instance orb08 (f = 1.6); Appendix E Computational Results for the JSPTWU
Control code
SPR911912004
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783658102913
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-658-10292-0
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote

Library Locations

Processing Feedback ...