國立虎尾科技大學 |

A Book of Open Shop Scheduling = Algorithms, Complexity and Applications /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	A Book of Open Shop Scheduling/ by Wieslaw Kubiak.
其他題名:	Algorithms, Complexity and Applications /
作者:	Kubiak, Wieslaw.
面頁冊數:	XIX, 277 p. 94 illus., 5 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Operations Research, Management Science . -
電子資源:	https://doi.org/10.1007/978-3-030-91025-9
ISBN:	9783030910259

A Book of Open Shop Scheduling = Algorithms, Complexity and Applications /
Kubiak, Wieslaw.

A Book of Open Shop SchedulingAlgorithms, Complexity and Applications /[electronic resource] :by Wieslaw Kubiak. - 1st ed. 2022. - XIX, 277 p. 94 illus., 5 illus. in color.online resource. - International Series in Operations Research & Management Science,3252214-7934 ;. - International Series in Operations Research & Management Science,227.

Chapter 1: Preliminaries -- Chapter 2: Makespan minimization for two-machine open shops -- Chapter 3: General open shop scheduling -- Chapter 4: Multiprocessor operations -- Chapter 5: Concurrent open shops -- Chapter 6: Open shop scheduling with simultaneity constraints -- Chapter 7: Proportionate and ordered open shops -- Chapter 8: Multiprocessor open shops -- Chapter 9: Compact scheduling of open shops -- Chapter 10: No-wait open shop scheduling -- Chapter 11: Applications of preemptive open shop scheduling -- Chapter 12: Two-machine open shop scheduling with time lags -- Index.

This book provides an in-depth presentation of algorithms for and complexity of open shop scheduling. Open shops allow operations of a job to be executed in any order, contrary to flow and job shops where the order is pre-specified. The author brings the field up to date with more emphasis on new and recent results, and connections with graph edge coloring and mathematical programming. The book explores applications to production and operations management, wireless network scheduling, and timetabling. The book is addressed to researchers, graduate students, and practitioners in Operations Research, Operations Management, computer science and mathematics, who are developing and using mathematical approaches to applications in manufacturing, services and distributed wireless network scheduling.

ISBN: 9783030910259

Standard No.: 10.1007/978-3-030-91025-9doiSubjects--Topical Terms:

1366052
Operations Research, Management Science .

LC Class. No.: T57.6-.97

Dewey Class. No.: 658.403

A Book of Open Shop Scheduling = Algorithms, Complexity and Applications /
LDR:02925nam a22004335i 4500 001 1092226
003 DE-He213
005 20220113203623.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783030910259 $9 978-3-030-91025-9
024 7 $a 10.1007/978-3-030-91025-9 $2 doi
035 $a 978-3-030-91025-9
050 4 $a T57.6-.97
072 7 $a KJT $2 bicssc
072 7 $a KJMD $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a KJT $2 thema
072 7 $a KJMD $2 thema
082 0 4 $a 658.403 $2 23
100 1 $a Kubiak, Wieslaw. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 895832
245 1 2 $a A Book of Open Shop Scheduling $h [electronic resource] : $b Algorithms, Complexity and Applications / $c by Wieslaw Kubiak.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XIX, 277 p. 94 illus., 5 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a International Series in Operations Research & Management Science, $x 2214-7934 ; $v 325
505 0 $a Chapter 1: Preliminaries -- Chapter 2: Makespan minimization for two-machine open shops -- Chapter 3: General open shop scheduling -- Chapter 4: Multiprocessor operations -- Chapter 5: Concurrent open shops -- Chapter 6: Open shop scheduling with simultaneity constraints -- Chapter 7: Proportionate and ordered open shops -- Chapter 8: Multiprocessor open shops -- Chapter 9: Compact scheduling of open shops -- Chapter 10: No-wait open shop scheduling -- Chapter 11: Applications of preemptive open shop scheduling -- Chapter 12: Two-machine open shop scheduling with time lags -- Index.
520 $a This book provides an in-depth presentation of algorithms for and complexity of open shop scheduling. Open shops allow operations of a job to be executed in any order, contrary to flow and job shops where the order is pre-specified. The author brings the field up to date with more emphasis on new and recent results, and connections with graph edge coloring and mathematical programming. The book explores applications to production and operations management, wireless network scheduling, and timetabling. The book is addressed to researchers, graduate students, and practitioners in Operations Research, Operations Management, computer science and mathematics, who are developing and using mathematical approaches to applications in manufacturing, services and distributed wireless network scheduling.
650 2 4 $a Operations Research, Management Science . $3 1366052
650 1 4 $a Operations Research and Decision Theory. $3 1366301
650 0 $a Management science. $3 719678
650 0 $a Operations research. $3 573517
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030910242
776 0 8 $i Printed edition: $z 9783030910266
776 0 8 $i Printed edition: $z 9783030910273
830 0 $a International Series in Operations Research & Management Science, $x 0884-8289 ; $v 227 $3 1254441
856 4 0 $u https://doi.org/10.1007/978-3-030-91025-9
912 $a ZDB-2-BUM
912 $a ZDB-2-SXBM
950 $a Business and Management (SpringerNature-41169)
950 $a Business and Management (R0) (SpringerNature-43719)