Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

Job Shop Scheduling with Consideration of Due Dates

Part of the Produktion und Logistik Book Series

DOI: 10.1007/978-3-658-10292-0

ISBN: 978-3-658-10291-3

Publisher: Springer Fachmedien Wiesbaden - Springer Journals

Jun 25, 2015

LitStream

Chapter 1Introduction

Kuhpfahl, Jens

Pages: 1 –8

[Scheduling is a natural working process that humans do every day. Planning daily life by scheduling daily tasks is mostly subconscious and not directed by a specific procedure. For example, when should I wash the dishes? Should I buy the groceries before or after doing the dishes? For scheduling...
LitStream

Chapter 2Job Shop Scheduling – Formulation and Modeling

Kuhpfahl, Jens

Pages: 9 –23

[Machine scheduling problems arise in different structures and settings. In order to obtain a clear comprehension of the contents in this thesis, the introduction of the job shop scheduling problem with total weighted tardiness objective will be detailed later in this chapter. In the first...
LitStream

Chapter 3Literature Review

Kuhpfahl, Jens

Pages: 25 –30

[In comparison to other scheduling problems, particularly the minimum makespan job shop scheduling problem, the JSPTWT has only received scholarly attention in the last 15 years. For the following sections, the publications related to the JSPTWT are distinguished according to the presented...
LitStream

Chapter 4Neighborhood Definitions for the JSPTWT

Kuhpfahl, Jens

Pages: 31 –64

[The vast majority of solution methods for solving machine scheduling problems exploits the concept of neighborhood search, like tabu search, iterated local search etc. In the development of heuristics for the JSPTWT, it is observable that local search techniques are often used (cf. Section 3)....
LitStream

Chapter 5Neighbor Evaluation Procedures in Local Search based Algorithms for solving the JSPTWT

Kuhpfahl, Jens

Pages: 65 –80

[Local search algorithms perform iteration processes in which a neighborhood search is repetitively executed. The computational effort of the neighborhood search should be as low as possible and as high as needed in order to make continuously improvements over a long period of time. The...
LitStream

Chapter 6Solving the JSPTWT – a new Solution Procedure

Kuhpfahl, Jens

Pages: 81 –118

[The primary goal of this thesis is to present the concept of a new solution procedure for solving the JSPTWT. As shown in Chapter 3, various solution procedures published in the related literature already exist (see e. g. [19, 41, 152]). Research results from the last few years show that these...
LitStream

Chapter 7Computational Study

Kuhpfahl, Jens

Pages: 119 –146

[The development of the new solution procedure EGRASP arises from the combination of the basic GRASP and further search strategies which are recommended for solving job shop scheduling problems. In this chapter, the suitability of the new approach shall be validated.]

results per page

Prev
1
Next

Browse All eBooks