國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Scheduling with times-changing effec...

Rustogi, Kabir.

Scheduling with times-changing effects and and rate-modifying activities

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Scheduling with times-changing effects and and rate-modifying activitiesby Vitaly A. Strusevich, Kabir Rustogi.
作者:	Strusevich, Vitaly A.
其他作者:	Rustogi, Kabir.
出版者:	Cham :Springer International Publishing :2017.
面頁冊數:	xxv, 455 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Production scheduling.
電子資源:	http://dx.doi.org/10.1007/978-3-319-39574-6
ISBN:	9783319395746$q(electronic bk.)

Scheduling with times-changing effects and and rate-modifying activities
Strusevich, Vitaly A.

Scheduling with times-changing effects and and rate-modifying activities[electronic resource] /by Vitaly A. Strusevich, Kabir Rustogi. - Cham :Springer International Publishing :2017. - xxv, 455 p. :ill., digital ;24 cm. - International series in operations research & management science,v.2430884-8289 ;. - International series in operations research & management science ;v. 140..

I Models and Methods of Classical Scheduling -- Models and Concepts of Classical Scheduling -- Pairwise Interchange Argument -- Sequencing under Precedence Constraints -- Relevant Boolean Programming Problems.

In scheduling theory, the models that have attracted considerable attention during the last two decades allow the processing times to be variable, i.e., to be subjected to various effects that make the actual processing time of a job dependent on its location in a schedule. The impact of these effects includes, but is not limited to, deterioration and learning. Under the first type of effect, the later a job is scheduled, the longer its actual processing time becomes. In the case of learning, delaying a job will result in shorter processing times. Scheduling with Time-Changing Effects and Rate-Modifying Activities covers and advances the state-of-the-art research in this area. The book focuses on single machine and parallel machine scheduling problems to minimize either the maximum completion time or the sum of completion times of all jobs, provided that the processing times are subject to various effects. Models that describe deterioration, learning and general non-monotone effects to be considered include positional, start-time dependent, cumulative and their combinations, which cover most of the traditionally used models. The authors also consider more enhanced models in which the decision-maker may insert certain Rate-Modifying Activities (RMA) on processing machines, such as for example, maintenance or rest periods. In any case, the processing times of jobs are not only dependent on effects mentioned above but also on the place of a job in a schedule relative to an RMA. For most of the enhanced models described in the book, polynomial-time algorithms are presented which are based on similar algorithmic ideas such as reduction to linear assignment problems (in a full form or in a reduced form), discrete convexity, and controlled generation of options.

ISBN: 9783319395746$q(electronic bk.)

Standard No.: 10.1007/978-3-319-39574-6doiSubjects--Topical Terms:

202753
Production scheduling.

LC Class. No.: TS157.5 / .S77 2017

Dewey Class. No.: 658.53

Scheduling with times-changing effects and and rate-modifying activities
LDR:03079nmm a2200325 a 4500 001 507739
003 DE-He213
005 20161018200858.0
006 m d
007 cr nn 008maaau
008 171031s2017 gw s 0 eng d
020 $a 9783319395746$q(electronic bk.)
020 $a 9783319395722$q(paper)
024 7 $a 10.1007/978-3-319-39574-6 $2 doi
035 $a 978-3-319-39574-6
040 $a GP $c GP
041 0 $a eng
050 4 $a TS157.5 $b .S77 2017
072 7 $a KJMV $2 bicssc
072 7 $a BUS087000 $2 bisacsh
082 0 4 $a 658.53 $2 23
090 $a TS157.5 $b .S927 2017
100 1 $a Strusevich, Vitaly A. $3 770150
245 1 0 $a Scheduling with times-changing effects and and rate-modifying activities $h [electronic resource] / $c by Vitaly A. Strusevich, Kabir Rustogi.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xxv, 455 p. : $b ill., digital ; $c 24 cm.
490 1 $a International series in operations research & management science, $x 0884-8289 ; $v v.243
505 0 $a I Models and Methods of Classical Scheduling -- Models and Concepts of Classical Scheduling -- Pairwise Interchange Argument -- Sequencing under Precedence Constraints -- Relevant Boolean Programming Problems.
520 $a In scheduling theory, the models that have attracted considerable attention during the last two decades allow the processing times to be variable, i.e., to be subjected to various effects that make the actual processing time of a job dependent on its location in a schedule. The impact of these effects includes, but is not limited to, deterioration and learning. Under the first type of effect, the later a job is scheduled, the longer its actual processing time becomes. In the case of learning, delaying a job will result in shorter processing times. Scheduling with Time-Changing Effects and Rate-Modifying Activities covers and advances the state-of-the-art research in this area. The book focuses on single machine and parallel machine scheduling problems to minimize either the maximum completion time or the sum of completion times of all jobs, provided that the processing times are subject to various effects. Models that describe deterioration, learning and general non-monotone effects to be considered include positional, start-time dependent, cumulative and their combinations, which cover most of the traditionally used models. The authors also consider more enhanced models in which the decision-maker may insert certain Rate-Modifying Activities (RMA) on processing machines, such as for example, maintenance or rest periods. In any case, the processing times of jobs are not only dependent on effects mentioned above but also on the place of a job in a schedule relative to an RMA. For most of the enhanced models described in the book, polynomial-time algorithms are presented which are based on similar algorithmic ideas such as reduction to linear assignment problems (in a full form or in a reduced form), discrete convexity, and controlled generation of options.
650 0 $a Production scheduling. $3 202753
650 1 4 $a Business and Management. $2 eflch $3 639169
650 2 4 $a Logistics. $3 200159
650 2 4 $a Operation Research/Decision Theory. $3 585050
650 2 4 $a Engineering Economics, Organization, Logistics, Marketing. $3 274009
700 1 $a Rustogi, Kabir. $3 770151
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a International series in operations research & management science ; $v v. 140. $3 490892
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-39574-6
950 $a Business and Management (Springer-41169)