Theoretical and Computational Research in Various Scheduling Models / / edited by Chin-Chia Wu and Win-Chin Lin.
Nine manuscripts were published in this Special Issue on "Theoretical and Computational Research in Various Scheduling Models, 2021" of the MDPI Mathematics journal, covering a wide range of topics connected to the theory and applications of various scheduling models and their extensions/g...
Saved in:
TeilnehmendeR: | |
---|---|
Place / Publishing House: | Basel, Switzerland : : MDPI - Multidisciplinary Digital Publishing Institute,, 2022. |
Year of Publication: | 2022 |
Language: | English |
Physical Description: | 1 online resource (208 pages) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
993562212904498 |
---|---|
ctrlnum |
(CKB)4920000001372272 (NjHacI)994920000001372272 (EXLCZ)994920000001372272 |
collection |
bib_alma |
record_format |
marc |
spelling |
Theoretical and Computational Research in Various Scheduling Models / edited by Chin-Chia Wu and Win-Chin Lin. Basel, Switzerland : MDPI - Multidisciplinary Digital Publishing Institute, 2022. 1 online resource (208 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Description based on publisher supplied metadata and other sources. Nine manuscripts were published in this Special Issue on "Theoretical and Computational Research in Various Scheduling Models, 2021" of the MDPI Mathematics journal, covering a wide range of topics connected to the theory and applications of various scheduling models and their extensions/generalizations. These topics include a road network maintenance project, cost reduction of the subcontracted resources, a variant of the relocation problem, a network of activities with generally distributed durations through a Markov chain, idea on how to improve the return loading rate problem by integrating the sub-tour reversal approach with the method of the theory of constraints, an extended solution method for optimizing the bi-objective no-idle permutation flowshop scheduling problem, the burn-in (B/I) procedure, the Pareto-scheduling problem with two competing agents, and three preemptive Pareto-scheduling problems with two competing agents, among others. We hope that the book will be of interest to those working in the area of various scheduling problems and provide a bridge to facilitate the interaction between researchers and practitioners in scheduling questions. Although discrete mathematics is a common method to solve scheduling problems, the further development of this method is limited due to the lack of general principles, which poses a major challenge in this research field. Science Study and teaching. Mathematics. 3-0365-3019-3 Wu, Chin-Chia, editor. Lin, Win-Chin, editor. |
language |
English |
format |
eBook |
author2 |
Wu, Chin-Chia, Lin, Win-Chin, |
author_facet |
Wu, Chin-Chia, Lin, Win-Chin, |
author2_variant |
c c w ccw w c l wcl |
author2_role |
TeilnehmendeR TeilnehmendeR |
title |
Theoretical and Computational Research in Various Scheduling Models / |
spellingShingle |
Theoretical and Computational Research in Various Scheduling Models / |
title_full |
Theoretical and Computational Research in Various Scheduling Models / edited by Chin-Chia Wu and Win-Chin Lin. |
title_fullStr |
Theoretical and Computational Research in Various Scheduling Models / edited by Chin-Chia Wu and Win-Chin Lin. |
title_full_unstemmed |
Theoretical and Computational Research in Various Scheduling Models / edited by Chin-Chia Wu and Win-Chin Lin. |
title_auth |
Theoretical and Computational Research in Various Scheduling Models / |
title_new |
Theoretical and Computational Research in Various Scheduling Models / |
title_sort |
theoretical and computational research in various scheduling models / |
publisher |
MDPI - Multidisciplinary Digital Publishing Institute, |
publishDate |
2022 |
physical |
1 online resource (208 pages) |
isbn |
3-0365-3019-3 |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA39 |
callnumber-sort |
QA 239.2 T446 42022 |
illustrated |
Not Illustrated |
dewey-hundreds |
500 - Science |
dewey-tens |
510 - Mathematics |
dewey-ones |
510 - Mathematics |
dewey-full |
510 |
dewey-sort |
3510 |
dewey-raw |
510 |
dewey-search |
510 |
work_keys_str_mv |
AT wuchinchia theoreticalandcomputationalresearchinvariousschedulingmodels AT linwinchin theoreticalandcomputationalresearchinvariousschedulingmodels |
status_str |
n |
ids_txt_mv |
(CKB)4920000001372272 (NjHacI)994920000001372272 (EXLCZ)994920000001372272 |
carrierType_str_mv |
cr |
is_hierarchy_title |
Theoretical and Computational Research in Various Scheduling Models / |
author2_original_writing_str_mv |
noLinkedField noLinkedField |
_version_ |
1764990041488097280 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02437nam a2200301 i 4500</leader><controlfield tag="001">993562212904498</controlfield><controlfield tag="005">20230222125151.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |||||||||||</controlfield><controlfield tag="008">230222s2022 sz o 000 0 eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)4920000001372272</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(NjHacI)994920000001372272</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)994920000001372272</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">NjHacI</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="c">NjHacl</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA39.2</subfield><subfield code="b">.T446 2022</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="2">23</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Theoretical and Computational Research in Various Scheduling Models /</subfield><subfield code="c">edited by Chin-Chia Wu and Win-Chin Lin.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Basel, Switzerland :</subfield><subfield code="b">MDPI - Multidisciplinary Digital Publishing Institute,</subfield><subfield code="c">2022.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (208 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Nine manuscripts were published in this Special Issue on "Theoretical and Computational Research in Various Scheduling Models, 2021" of the MDPI Mathematics journal, covering a wide range of topics connected to the theory and applications of various scheduling models and their extensions/generalizations. These topics include a road network maintenance project, cost reduction of the subcontracted resources, a variant of the relocation problem, a network of activities with generally distributed durations through a Markov chain, idea on how to improve the return loading rate problem by integrating the sub-tour reversal approach with the method of the theory of constraints, an extended solution method for optimizing the bi-objective no-idle permutation flowshop scheduling problem, the burn-in (B/I) procedure, the Pareto-scheduling problem with two competing agents, and three preemptive Pareto-scheduling problems with two competing agents, among others. We hope that the book will be of interest to those working in the area of various scheduling problems and provide a bridge to facilitate the interaction between researchers and practitioners in scheduling questions. Although discrete mathematics is a common method to solve scheduling problems, the further development of this method is limited due to the lack of general principles, which poses a major challenge in this research field.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Science</subfield><subfield code="x">Study and teaching.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematics.</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-0365-3019-3</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Chin-Chia,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lin, Win-Chin,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-03-01 00:19:00 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2022-09-22 08:09:39 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5338073130004498&Force_direct=true</subfield><subfield code="Z">5338073130004498</subfield><subfield code="8">5338073130004498</subfield></datafield></record></collection> |