大葉大學圖書館 |

Job shop scheduling with consideration of due dates[electronic resource] :potentials of local search based solution techniques /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	658.53
書名/作者:	Job shop scheduling with consideration of due dates : potentials of local search based solution techniques // by Jens Kuhpfahl.
作者:	Kuhpfahl, Jens.
出版者:	Wiesbaden : : Springer Fachmedien Wiesbaden :, 2016.
面頁冊數:	xxv, 190 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Production scheduling.
標題:	Industrial efficiency.
標題:	Economics/Management Science.
標題:	Production/Logistics/Supply Chain Management.
標題:	Operation Research/Decision Theory.
ISBN:	9783658102920
ISBN:	9783658102913
摘要、提要註:	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. Contents 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)
電子資源:	http://dx.doi.org/10.1007/978-3-658-10292-0

Job shop scheduling with consideration of due dates[electronic resource] :potentials of local search based solution techniques /
Kuhpfahl, Jens.

Job shop scheduling with consideration of due datespotentials of local search based solution techniques /[electronic resource] :by Jens Kuhpfahl. - Wiesbaden :Springer Fachmedien Wiesbaden :2016. - xxv, 190 p. :ill., digital ;24 cm. - Produktion und logistik. - 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. Contents 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)

ISBN: 9783658102920

Standard No.: 10.1007/978-3-658-10292-0doiSubjects--Topical Terms:

404211
Production scheduling.

LC Class. No.: TS157.5

Dewey Class. No.: 658.53

Job shop scheduling with consideration of due dates[electronic resource] :potentials of local search based solution techniques /
LDR:02063nam a2200325 a 4500 001 454231
003 DE-He213
005 20160707160053.0
006 m d
007 cr nn 008maaau
008 161227s2016 gw s 0 eng d
020 $a 9783658102920 $q (electronic bk.)
020 $a 9783658102913 $q (paper)
024 7 $a 10.1007/978-3-658-10292-0 $2 doi
035 $a 978-3-658-10292-0
040 $a GP $c GP
041 0 $a eng
050 4 $a TS157.5
072 7 $a KJMV5 $2 bicssc
072 7 $a KJMV8 $2 bicssc
072 7 $a BUS087000 $2 bisacsh
082 0 4 $a 658.53 $2 23
090 $a TS157.5 $b .K96 2016
100 1 $a Kuhpfahl, Jens. $3 651541
245 1 0 $a Job shop scheduling with consideration of due dates $h [electronic resource] : $b potentials of local search based solution techniques / $c by Jens Kuhpfahl.
260 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Gabler, $c 2016.
300 $a xxv, 190 p. : $b ill., digital ; $c 24 cm.
490 1 $a Produktion und logistik
520 $a 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. Contents 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)
650 0 $a Production scheduling. $3 404211
650 0 $a Industrial efficiency. $3 404315
650 1 4 $a Economics/Management Science. $3 463465
650 2 4 $a Production/Logistics/Supply Chain Management. $3 463855
650 2 4 $a Operation Research/Decision Theory. $3 511310
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Produktion und logistik. $3 604010
856 4 0 $u http://dx.doi.org/10.1007/978-3-658-10292-0
950 $a Business and Economics (Springer-11643)