Download pdf Information Systems Architecture And Technology Proceedings Of 40Th Anniversary International Conference On Information Systems Architecture And Technology Isat 2019 Part Ii Jerzy Swiatek ebook full chapter

Information Systems Architecture and
Technology Proceedings of 40th

Anniversary International Conference
on Information Systems Architecture
and Technology ISAT 2019 Part II Jerzy
■wi■tek
Visit to download the full and correct content document:
https://textbookfull.com/product/information-systems-architecture-and-technology-pro
ceedings-of-40th-anniversary-international-conference-on-information-systems-archit
ecture-and-technology-isat-2019-part-ii-jerzy-swiatek/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Information Systems Architecture and Technology

Proceedings of 40th Anniversary International
Conference on Information Systems Architecture and
Technology ISAT 2019 Part I Leszek Borzemski
https://textbookfull.com/product/information-systems-
architecture-and-technology-proceedings-of-40th-anniversary-
international-conference-on-information-systems-architecture-and-
technology-isat-2019-part-i-leszek-borzemski/

Proceedings of 40th Anniversary International
Conference on Information Systems Architecture and
Technology ISAT 2019 Part III Zofia Wilimowska
architecture-and-technology-proceedings-of-40th-anniversary-
international-conference-on-information-systems-architecture-and-
technology-isat-2019-part-iii-zofia-wilimowska/

Proceedings of 36th International Conference on
Information Systems Architecture and Technology ISAT
2015 Part III 1st Edition Jerzy ■wi■tek
architecture-and-technology-proceedings-of-36th-international-
conference-on-information-systems-architecture-and-technology-
isat-2015-part-iii-1st-edition-jerzy-swiatek/
Information Technology and Systems Proceedings of ICITS

2019 Álvaro Rocha
https://textbookfull.com/product/information-technology-and-
systems-proceedings-of-icits-2019-alvaro-rocha/
Recent Advances in Information and Communication
Technology 2019: Proceedings of the 15th International
Conference on Computing and Information Technology
(IC2IT 2019) Pongsarun Boonyopakorn
https://textbookfull.com/product/recent-advances-in-information-
and-communication-technology-2019-proceedings-of-the-15th-
international-conference-on-computing-and-information-technology-
ic2it-2019-pongsarun-boonyopakorn/
Business Information Systems: 22nd International

Conference, BIS 2019, Seville, Spain, June 26–28, 2019,
Proceedings, Part II Witold Abramowicz
https://textbookfull.com/product/business-information-
systems-22nd-international-conference-bis-2019-seville-spain-
june-26-28-2019-proceedings-part-ii-witold-abramowicz/
Proceedings of the International Conference on

Information Technology & Systems (ICITS 2018) 1st
Edition Álvaro Rocha
https://textbookfull.com/product/proceedings-of-the-
international-conference-on-information-technology-systems-
icits-2018-1st-edition-alvaro-rocha/
Proceedings of Second International Conference on

Electrical Systems Technology and Information 2015
ICESTI 2015 1st Edition Felix Pasila
https://textbookfull.com/product/proceedings-of-second-
international-conference-on-electrical-systems-technology-and-
information-2015-icesti-2015-1st-edition-felix-pasila/
Engineering, Information and Agricultural Technology in

the Global Digital Revolution-Proceedings of the 1st
International Conference on Civil Engineering,
Electrical Engineering, Information Systems,
Information Technology, and Agricultural Technology (S
https://textbookfull.com/product/engineering-information-and-
agricultural-technology-in-the-global-digital-revolution-
1st Edition Aria Hendrawan (Editor)
proceedings-of-the-1st-international-conference-on-civil-
Advances in Intelligent Systems and Computing 1051
Jerzy Świątek
Leszek Borzemski
Zofia Wilimowska Editors
Information Systems
Architecture and Technology:
Proceedings of 40th
Anniversary International
Conference on Information
Systems Architecture and
Technology – ISAT 2019
Part II
Advances in Intelligent Systems and Computing
Volume 1051
Series Editor
Janusz Kacprzyk, Systems Research Institute, Polish Academy of Sciences,
Warsaw, Poland
Advisory Editors
Nikhil R. Pal, Indian Statistical Institute, Kolkata, India
Rafael Bello Perez, Faculty of Mathematics, Physics and Computing,
Universidad Central de Las Villas, Santa Clara, Cuba
Emilio S. Corchado, University of Salamanca, Salamanca, Spain
Hani Hagras, School of Computer Science and Electronic Engineering,
University of Essex, Colchester, UK
László T. Kóczy, Department of Automation, Széchenyi István University,
Gyor, Hungary
Vladik Kreinovich, Department of Computer Science, University of Texas
at El Paso, El Paso, TX, USA
Chin-Teng Lin, Department of Electrical Engineering, National Chiao
Tung University, Hsinchu, Taiwan
Jie Lu, Faculty of Engineering and Information Technology,
University of Technology Sydney, Sydney, NSW, Australia
Patricia Melin, Graduate Program of Computer Science, Tijuana Institute
of Technology, Tijuana, Mexico
Nadia Nedjah, Department of Electronics Engineering, University of Rio de Janeiro,
Rio de Janeiro, Brazil
Ngoc Thanh Nguyen , Faculty of Computer Science and Management,
Wrocław University of Technology, Wrocław, Poland
Jun Wang, Department of Mechanical and Automation Engineering,
The Chinese University of Hong Kong, Shatin, Hong Kong
The series “Advances in Intelligent Systems and Computing” contains publications
on theory, applications, and design methods of Intelligent Systems and Intelligent
Computing. Virtually all disciplines such as engineering, natural sciences, computer
and information science, ICT, economics, business, e-commerce, environment,
healthcare, life science are covered. The list of topics spans all the areas of modern
intelligent systems and computing such as: computational intelligence, soft comput-
ing including neural networks, fuzzy systems, evolutionary computing and the fusion
of these paradigms, social intelligence, ambient intelligence, computational neuro-
science, artificial life, virtual worlds and society, cognitive science and systems,
Perception and Vision, DNA and immune based systems, self-organizing and
adaptive systems, e-Learning and teaching, human-centered and human-centric
computing, recommender systems, intelligent control, robotics and mechatronics
including human-machine teaming, knowledge-based paradigms, learning para-
digms, machine ethics, intelligent data analysis, knowledge management, intelligent
agents, intelligent decision making and support, intelligent network security, trust
management, interactive entertainment, Web intelligence and multimedia.
The publications within “Advances in Intelligent Systems and Computing” are
primarily proceedings of important conferences, symposia and congresses. They
cover significant recent developments in the field, both of a foundational and
applicable character. An important characteristic feature of the series is the short
publication time and world-wide distribution. This permits a rapid and broad
dissemination of research results.
** Indexing: The books of this series are submitted to ISI Proceedings,

EI-Compendex, DBLP, SCOPUS, Google Scholar and Springerlink **
More information about this series at http://www.springer.com/series/11156

Jerzy Świątek Leszek Borzemski
• •
Zofia Wilimowska
Editors
Information Systems
Architecture and Technology:
Proceedings of 40th
Anniversary International
Conference on Information
Systems Architecture
and Technology – ISAT 2019
Part II
123
Editors
Jerzy Świątek Leszek Borzemski
Faculty of Computer Science Faculty of Computer Science
and Management and Management
Wrocław University of Science Wrocław University of Science
and Technology and Technology
Wrocław, Poland Wrocław, Poland
Zofia Wilimowska
University of Applied Sciences in Nysa
Nysa, Poland
ISSN 2194-5357 ISSN 2194-5365 (electronic)

Advances in Intelligent Systems and Computing
ISBN 978-3-030-30603-8 ISBN 978-3-030-30604-5 (eBook)
https://doi.org/10.1007/978-3-030-30604-5
© Springer Nature Switzerland AG 2020
This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part
of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations,
recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission
or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar
methodology now known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this
publication does not imply, even in the absence of a specific statement, that such names are exempt from
the relevant protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this
book are believed to be true and accurate at the date of publication. Neither the publisher nor the
authors or the editors give a warranty, expressed or implied, with respect to the material contained
herein or for any errors or omissions that may have been made. The publisher remains neutral with regard
to jurisdictional claims in published maps and institutional affiliations.
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
We are pleased to present before you the proceedings of the 2019 40th Anniversary
International Conference Information Systems Architecture and Technology
(ISAT), or ISAT 2019 for short, held on September 15–17, 2019 in Wrocław,
Poland. The conference was organized by the Department of Computer Science,
Faculty of Computer Science and Management, Wrocław University of Science and
Technology, Poland, and the University of Applied Sciences in Nysa, Poland.
The International Conference on Information Systems Architecture and
Technology has been organized by the Wrocław University of Science and
Technology from the eighties of the last century. Most of the events took place in
Szklarska Poręba and Karpacz—charming small towns in the Karkonosze
Mountains, Lower Silesia in the southwestern part of Poland. This year 2019, we
celebrate the 40th anniversary of the conference in Wrocław—the capital of Lower
Silesia, a city with a thousand-year history. A beautiful and modern city that is
developing dynamically and is a meeting point for people from all over the world. It
is worth noting that Wrocław is currently one of the most important centers for the
development of modern software and information systems in Poland.
The past four decades have also been a period of dynamic development of
computer science, which we can recall when reviewing conference materials from
these years—their shape and content were always created with current achieve-
ments of national and international IT.
The purpose of the ISAT is to discuss a state-of-art of information systems
concepts and applications as well as architectures and technologies supporting
contemporary information systems. The aim is also to consider an impact of
knowledge, information, computing and communication technologies on managing
of the organization scope of functionality as well as on enterprise information
systems design, implementation, and maintenance processes taking into account
various methodological, technological, and technical aspects. It is also devoted to
information systems concepts and applications supporting the exchange of goods
and services by using different business models and exploiting opportunities offered
by Internet-based electronic business and commerce solutions.
v
vi Preface
ISAT is a forum for specific disciplinary research, as well as on

multi-disciplinary studies to present original contributions and to discuss different
subjects of today’s information systems planning, designing, development, and
implementation.
The event is addressed to the scientific community, people involved in a variety
of topics related to information, management, computer and communication sys-
tems, and people involved in the development of business information systems and
business computer applications. ISAT is also devoted as a forum for the presen-
tation of scientific contributions prepared by MSc. and Ph.D. students. Business,
Commercial, and Industry participants are welcome.
This year, we received 141 papers from 20 countries. The papers included in the
three proceedings volumes have been subject to a thoroughgoing review process by
highly qualified peer reviewers. The final acceptance rate was 60%. Program Chairs
selected 85 best papers for oral presentation and publication in the 40th
International Conference Information Systems Architecture and Technology 2019
proceedings.
The papers have been clustered into three volumes:
Part I—discoursing about essential topics of information technology including, but
not limited to, Computer Systems Security, Computer Network Architectures,
Distributed Computer Systems, Quality of Service, Cloud Computing and
High-Performance Computing, Human–Computer Interface, Multimedia Systems,
Big Data, Knowledge Discovery and Data Mining, Software Engineering,
E-Business Systems, Web Design, Optimization and Performance, Internet of
Things, Mobile Systems, and Applications.
Part II—addressing topics including, but not limited to, Pattern Recognition and
Image Processing Algorithms, Production Planning and Management Systems, Big
Data Analysis, Knowledge Discovery, and Knowledge-Based Decision Support
and Artificial Intelligence Methods and Algorithms.
Part III—is gain to address very hot topics in the field of today’s various
computer-based applications—is devoted to information systems concepts and
applications supporting the managerial decisions by using different business models
and exploiting opportunities offered by IT systems. It is dealing with topics
including, but not limited to, Knowledge-Based Management, Modeling of
Financial and Investment Decisions, Modeling of Managerial Decisions,
Production and Organization Management, Project Management, Risk
Management, Small Business Management, Software Tools for Production,
Theories, and Models of Innovation.
We would like to thank the Program Committee Members and Reviewers,
essential for reviewing the papers to ensure a high standard of the ISAT 2019
conference, and the proceedings. We thank the authors, presenters, and participants
of ISAT 2019 without them the conference could not have taken place. Finally, we
Preface vii
thank the organizing team for the efforts this and previous years in bringing the
conference to a successful conclusion.
We hope that ISAT conference is a good scientific contribution to the devel-
opment of information technology not only in the region but also internationally. It
happens, among others, thanks to cooperation with Springer Publishing House,
where the AISC series is issued from 2015. We want to thank Springer’s people
who deal directly with the publishing process, from publishing contracts to the
delivering of printed books. Thank you for your cooperation.
September 2019 Leszek Borzemski

Jerzy Świątek
Zofia Wilimowska
Organization
ISAT 2019 Conference Organization

General Chair
Leszek Borzemski, Poland
Program Co-chairs
Leszek Borzemski, Poland
Jerzy Świątek, Poland
Zofia Wilimowska, Poland
Local Organizing Committee

Leszek Borzemski (Chair)
Zofia Wilimowska (Co-chair)
Jerzy Świątek (Co-chair)
Mariusz Fraś (Conference Secretary, Website Support)
Arkadiusz Górski (Technical Editor)
Anna Kamińska (Technical Secretary)
Ziemowit Nowak (Technical Support)
Kamil Nowak (Website Coordinator)
Danuta Seretna-Sałamaj (Technical Secretary)
International Program Committee

Leszek Borzemski (Chair), Poland Zbigniew Banaszak, Poland
Jerzy Świątek (Co-chair), Poland Elena N. Benderskaya, Russia
Zofia Wilimowska (Co-chair), Poland Janos Botzheim, Japan
Witold Abramowicz, Poland Djallel E. Boubiche, Algeria
Dhiya Al-Jumeily, UK Patrice Boursier, France
Iosif Androulidakis, Greece Anna Burduk, Poland
Patricia Anthony, New Zealand Andrii Buriachenko, Ukraine
ix
x Organization
Udo Buscher, Germany Marian Molasy, Poland

Wojciech Cellary, Poland Zbigniew Nahorski, Poland
Haruna Chiroma, Malaysia Kazumi Nakamatsu, Japan
Edward Chlebus, Poland Peter Nielsen, Denmark
Gloria Cerasela Crisan, Romania Tadashi Nomoto, Japan
Marilia Curado, Portugal Cezary Orłowski, Poland
Czesław Daniłowicz, Poland Sandeep Pachpande, India
Zhaohong Deng, China Michele Pagano, Italy
Małgorzata Dolińska, Poland George A. Papakostas, Greece
Ewa Dudek-Dyduch, Poland Zdzisław Papir, Poland
Milan Edl, Czech Republic Marek Pawlak, Poland
El-Sayed M. El-Alfy, Jan Platoš, Czech Republic
Saudi Arabia Tomasz Popławski, Poland
Peter Frankovsky, Slovakia Edward Radosinski, Poland
Naoki Fukuta, Japan Wolfgang Renz, Germany
Bogdan Gabryś, UK Dolores I. Rexachs, Spain
Piotr Gawkowski, Poland José S. Reyes, Spain
Manuel Graña, Spain Leszek Rutkowski, Poland
Katsuhiro Honda, Japan Sebastian Saniuk, Poland
Marian Hopej, Poland Joanna Santiago, Portugal
Zbigniew Huzar, Poland Habib Shah, Malaysia
Natthakan Iam-On, Thailand J. N. Shah, India
Biju Issac, UK Jeng Shyang, Taiwan
Arun Iyengar, USA Anna Sikora, Spain
Jürgen Jasperneite, Germany Marcin Sikorski, Poland
Janusz Kacprzyk, Poland Małgorzata Sterna, Poland
Henryk Kaproń, Poland Janusz Stokłosa, Poland
Yury Y. Korolev, Belarus Remo Suppi, Spain
Yannis L. Karnavas, Greece Edward Szczerbicki, Australia
Ryszard Knosala, Poland Eugeniusz Toczyłowski, Poland
Zdzisław Kowalczuk, Poland Elpida Tzafestas, Greece
Lumír Kulhanek, Czech Republic José R. Villar, Spain
Binod Kumar, India Bay Vo, Vietnam
Jan Kwiatkowski, Poland Hongzhi Wang, China
Antonio Latorre, Spain Leon S. I. Wang, Taiwan
Radim Lenort, Czech Republic Junzo Watada, Japan
Gang Li, Australia Eduardo A. Durazo Watanabe, India
José M. Merigó Lindahl, Chile Jan Werewka, Poland
Jose M. Luna, Spain Thomas Wielicki, USA
Emilio Luque, Spain Bernd Wolfinger, Germany
Sofian Maabout, France Józef Woźniak, Poland
Lech Madeyski, Poland Roman Wyrzykowski, Poland
Zygmunt Mazur, Poland Yue Xiao-Guang, Hong Kong
Elżbieta Mączyńska, Poland Jaroslav Zendulka, Czech Republic
Pedro Medeiros, Portugal Bernard Ženko, Slovenia
Toshiro Minami, Japan
Organization xi
ISAT 2019 Reviewers

Hamid Al-Asadi, Iraq Dorota Kuchta, Poland
S. Balakrishnan, India Binod Kumar, India
Zbigniew Banaszak, Poland Jan Kwiatkowski, Poland
Agnieszka Bieńkowska, Poland Wojciech Lorkiewicz, Poland
Grzegorz Bocewicz, Poland Marek Lubicz, Poland
Leszek Borzemski, Poland Zbigniew Malara, Poland
Janos Botzheim, Hungary Mariusz Mazurkiewicz, Poland
Krzysztof Brzostowski, Poland Vojtěch Merunka, Czech Republic
Anna Burduk, Poland Rafał Michalski, Poland
Wojciech Cellary, Poland Bożena Mielczarek, Poland
Haruna Chiroma, Malaysia Peter Nielsen, Denmark
Grzegorz Chodak, Poland Ziemowit Nowak, Poland
Piotr Chwastyk, Poland Donat Orski, Poland
Gloria Cerasela Crisan, Romania Michele Pagano, Italy
Anna Czarnecka, Poland Jonghyun Park, Korea
Mariusz Czekała, Poland Agnieszka Parkitna, Poland
Yousef Daradkeh, Saudi Arabia Marek Pawlak, Poland
Grzegorz Debita, Poland Dolores Rexachs, Spain
Anna Jolanta Dobrowolska, Poland Paweł Rola, Poland
Jarosław Drapała, Poland Stefano Rovetta, Italy
Maciej Drwal, Poland Abdel-Badeeh Salem, Egypt
Tadeusz Dudycz, Poland Joanna Santiago, Portugal
Grzegorz Filcek, Poland Danuta Seretna-Sałamaj, Poland
Mariusz Fraś, Poland Anna Sikora, Spain
Piotr Gawkowski, Poland Marcin Sikorski, Poland
Dariusz Gąsior, Poland Jan Skonieczny, Poland
Arkadiusz Górski, Poland Malgorzata Sterna, Poland
Jerzy Grobelny, Poland Janusz Stokłosa, Poland
Krzysztof Grochla, Poland Grażyna Suchacka, Poland
Houda Hakim Guermazi, Tunisia Joanna Szczepańska, Poland
Biju Issac, UK Edward Szczerbicki, Australia
Jerzy Józefczyk, Poland Jerzy Świątek, Poland
Ireneusz Jóźwiak, Poland Kamila Urbańska, Poland
Krzysztof Juszczyszyn, Poland Jan Werewka, Poland
Tetiana Viktorivna Kalashnikova, Zofia Wilimowska, Poland
Ukraine Marek Wilimowski, Poland
Jan Kałuski, Poland Bernd Wolfinger, Germany
Anna Maria Kamińska, Poland Józef Woźniak, Poland
Radosław Katarzyniak, Poland Krzysztof Zatwarnicki, Poland
Agata Klaus-Rosińska, Poland Jaroslav Zendulka, Czech Republic
Grzegorz Kołaczek, Poland Chunbiao Zhu,
Iryna Koshkalda, Ukraine People’s Republic of China
Zdzisław Kowalczuk, Poland
xii Organization
ISAT 2019 Keynote Speaker
Professor Cecilia Zanni-Merk, Normandie Université, INSA Rouen, LITIS,

Saint-Etienne-du-Rouvray, France
Topic: On the Need of an Explainable Artificial Intelligence

Contents
Production Planning and Management System

Synthesis of No-Wait Cyclic Schedules for Cascade-Like Systems
of Repetitive Processes with Fixed Periods . . . . . . . . . . . . . . . . . . . . . . . 3
Robert Wójcik, Grzegorz Bocewicz, and Zbigniew Banaszak
Robust Competence Allocation for Multi-project Scheduling . . . . . . . . . 16
Grzegorz Bocewicz, Jarosław Wikarek, Paweł Sitek,
and Zbigniew Banaszak
Calculation of Labour Input in Multivariant Production
with Use of Simulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
Joanna Kochańska, Dagmara Górnicka, and Anna Burduk
Production Resources Utilization Improvement
with the Use of Simulation Modelling . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
Dagmara Górnicka, Joanna Kochańska, and Anna Burduk
Numerical Studies on the Effectiveness of Optimization Algorithms
to Identify the Parameters of Machine Tool Hybrid Body Structural
Component Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
Paweł Dunaj, Stefan Berczyński, and Sławomir Marczyński
The Use of Knowledge-Based Engineering Systems and Artificial
Intelligence in Product Development: A Snapshot . . . . . . . . . . . . . . . . . 62
Stefan Plappert, Paul Christoph Gembarski, and Roland Lachmayer
State Machine of a Redundant Computing Unit Operating
as a Cyber-Physical System Control Node
with Hot-Standby Redundancy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74
Jacek Stój
xiii
xiv Contents
Systems Analysis and Modeling

Estimation of the Characteristics of the Stochastic Interconnection
of Meteorological Elements of an Aerodrome for Solving Problems
of Forecasting Flight Conditions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
N. F. Khalimon, D. P. Kucherov, and I. V. Ogirko
From Interactive Simulations Towards Decision Patterns
in Conflict Situations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
Andrzej Najgebauer
Sequential Function Chart to Function Block
Diagram Transformation with Explicit State Representation . . . . . . . . . 115
Maciej Hojda, Grzegorz Filcek, and Grzegorz Popek
Online Environment for Prototyping and Testing Graph
and Network Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125
Kamil Banach and Rafał Kasprzyk
Evolutionary Strategies of Intelligent Agent Training . . . . . . . . . . . . . . 135
Assel Akzhalova, Atsushi Inoue, and Dmitry Mukharsky
An Optimization Algorithm Based on Multi-free Dynamic Schema
of Chromosomes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146
Radhwan Al-Jawadi, Marcin Studniarski, and Aisha Younus
Knowledge Discovery and Data Mining

Scientists’ Contribution to Science and Methods of Its Visualization . . . 159
Oleksandr Sokolov, Veslava Osińska, Aleksandra Mrela,
Włodzisław Duch, and Marcin Burak
Towards a Pragmatic Model of an Artificial Conversational Partner:
Opening the Blackbox . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 169
Baptiste Jacquet and Jean Baratgin
Random Forests in a Glassworks: Knowledge Discovery
from Industrial Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179
Galina Setlak and Lukasz Pasko
Predicting Suitable Time for Sending Marketing Emails . . . . . . . . . . . . 189
Ján Paralič, Tomáš Kaszoni, and Jakub Mačina
Different Hierarchical Clustering Methods in Basic-Level Extraction
Using Multidendrogram . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
Mariusz Mulka and Wojciech Lorkiewicz
Elimination of Redundant Association Rules . . . . . . . . . . . . . . . . . . . . . 208
Bemarisika Parfait and Totohasina André
Contents xv
Artificial Intelligence Methods and Its Applocations

A Kernel Iterative K-Means Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . 221
Bernd-Jürgen Falkowski
Research on the Development of Expert Systems Using
Artificial Intelligence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 233
Rustam A. Burnashev, Ruslan G. Gabdrahmanov, Ismail F. Amer,
Galim Z. Vakhitov, and Arslan I. Enikeev
Machine-Learning and R in Plastic Surgery – Evaluation of Facial
Attractiveness and Classification of Facial Emotions . . . . . . . . . . . . . . . 243
Lubomír Štěpánek, Pavel Kasal, and Jan Měšťák
Recognition of Antisocial Behavior in Online Discussions . . . . . . . . . . . 253
Kristína Machová and Dominik Kolesár
Evaluation of the Classifiers in Multiparameter and Imbalanced
Data Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 263
Piotrowska Ewelina
Image Processing
Time of Flight Camera Calibration and Obstacle Detection
Application for an Autonomous Vehicle . . . . . . . . . . . . . . . . . . . . . . . . . 277
Leanne Miller, Antonio Ros García, Pedro J. Navarro Lorente,
Carlos Fernández Andrés, and Raúl Borraz Morón
The Implementation of a Convolutional Neural Network
for the Detection of the Transmission Towers Using
Satellite Imagery . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
Paweł Michalski, Bogdan Ruszczak, and Pedro Javier Navarro Lorente
The Image Classification of Workstation Instructions Using
Convolutional Neural Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 300
Daniel Halikowski and Justyna Patalas-Maliszewska
Automatic Tissue Type Classification in Large-Scale Microscopic
Images Using Zernike Moments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 310
Aneta Górniak and Ewa Skubalska-Rafajłowicz
Enhanced Hierarchical Multi-resolution Imaging . . . . . . . . . . . . . . . . . . 320
P. Joy Prabhakaran
Prefiltration Analysis for Image Recognition Algorithms
for the Android Mobile Platform . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 330
Kamil Buczel and Jolanta Wrzuszczak-Noga
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341

Production Planning and Management
System
Synthesis of No-Wait Cyclic Schedules
for Cascade-Like Systems of Repetitive
Processes with Fixed Periods
Robert Wójcik1(&) , Grzegorz Bocewicz2 ,

and Zbigniew Banaszak2
1
Department of Computer Engineering, Faculty of Electronics,
Wrocław University of Science and Technology, Wrocław, Poland
robert.wojcik@pwr.edu.pl
2
Department of Computer Science and Management,
Koszalin University of Technology, Koszalin, Poland
{grzegorz.bocewicz,
zbigniew.banaszak}@ie.tu.koszalin.pl
Abstract. The paper deals with the problem of synthesis of cyclic schedules for
cascade-like topology repetitive systems that share resources using the mutual
exclusion rule. Such processes are represented by, for example, repetitive
transport tasks occurring in AGV systems, in which the carriages share sectors
of routes belonging to neighboring manufacturing cells or cyclic operations
carried out in urban transport systems such as train, subway, in which individual
lines use shared hubs (i.e. inter-change stations, cross-platforms, etc.) combining
mesh-like communication networks. In this context, the problem in question
concerns determining the operation times of cascade-like repetitive processes
and their start times, which guarantee the existence of a no-wait cyclic schedule
of processes. An extended variant of the cascade-like system is considered, in
which, in comparison to the classical “chain” model with two operations carried
out as part of the process, each cyclic component process contains additional
operations. The purpose of this work is to provide necessary and sufficient
conditions for process operations and their start times to ensure that there is a
cyclic schedule free of waiting for resources, and then apply the developed
conditions in the synthesis procedure of the cascade-like system parameters.
Keywords: Cascade-like topology Repetitive processes Cycle time

No-wait cyclic schedules Synthesis of parameters
Constraint satisfaction problem
1 Introduction
In many modern transport systems [7, 22, 23] (e.g. metro, railway, bus lines) and
automated production systems [10, 17, 24] (e.g. AMSs, AGVs) there are repetitive
tasks executed concurrently, each of which has the form of a sequence of operations,
carried out using system resources (e.g. machines, buffers, sectors of transport net-
works). Particular tasks, often identified with certain processes implemented in the
© Springer Nature Switzerland AG 2020

J. Świątek et al. (Eds.): ISAT 2019, AISC 1051, pp. 3–15, 2020.
https://doi.org/10.1007/978-3-030-30604-5_1
4 R. Wójcik et al.
system, are defined by means of various parameters [3, 7, 16, 24], which describe,
among others: resource and operation sets, way of flow of tasks (processes) through the
system (e.g. flow-shop, job-shop), restrictions on the sequence of operations (e.g. in the
form of directed graphs of operations), operation times (i.e. availability of resources),
as well as additional restrictions [16, 21, 32] resulting from the specific use of resources
by processes and system activities (e.g. sharing resources in the mutual exclusion
mode, blocking the resources while waiting for other resources, no waiting for the
resources).
In order to ensure the effective operation of the systems, appropriate schedules of
the flow of tasks (processes) that will guarantee their correct implementation as well as
the optimization of selected criteria are necessary. The cyclic scheduling problems
considered concern mainly minimization of cycle time [1, 12, 27], minimization of
waiting times for resources, as well as maximization of the level of resource utilization
in flow-shop [1, 16, 19] or job-shop systems [12, 13, 24]. Inclusion of additional
restrictions in the form of resource blocking (no-store, no-buffer restrictions) in clas-
sical cyclic scheduling problems [1, 2, 13, 27] while waiting for availability of other
resources necessary to perform another operation, and/or no waiting the initiated tasks
for the execution of subsequent operations after the end of the previous ones [5, 6, 19,
23] leads to decision and optimization problems, which are difficult computationally
[18, 21] (NP-hard). Formulated problems often do not have any solutions acceptable
due to the occurrence of deadlock state of processes and the need to wait for shared
resources.
In production systems, the no-store constraint [1, 16, 27] means no buffer storage of
the semi-products between the machines or the limitation of their capacity. As a
consequence, it can lead to blocking machines while waiting for products to perform
subsequent operations (machine downtime), and a system deadlock state [9, 20, 23],
which will stop the execution of tasks. In turn, in transport systems, the no-buffer
restriction is related to the lack of parallelization of sectors belonging to the routes and
blocking of sectors by transport devices (e.g. trains, AGVs) [10, 11, 22, 23] while
waiting for entry to subsequent sectors.
In the case of a no-wait constraint, the initiated tasks (processes) can not wait for
the next operations to start, however, depending on the interpretation [5, 6, 23, 29, 30]
this may apply to all operations or only selected operations, e.g. on machines right after
transport operations. Often, no-wait and no-buffer restrictions are adopted simultane-
ously, which makes the problem of cyclic scheduling even more difficult, as the
deadlock problem needs to be solved [9, 15, 20].
Most deterministic cyclic scheduling problems are decision NP-complete analysis
problems or NP-hard optimization problems [18, 21], which can be reduced to the
answer to the questions: is there a cyclic schedule that meets the limitations of the
problem described by a given set of parameters or is there an acceptable schedule that
minimizes the period of completing the tasks? Problems of this type use different
models and are solved using various methods. Due to the high computational com-
plexity of the problems, heuristic and metaheuristic methods are mainly used [2, 6, 19,
26, 27], which allow rapid determination of solutions, but they do not guarantee finding
an optimal solution, or even an acceptable solution, because in the case of limitations
no-buffer and no-wait types, such solutions may not exist for systems with given
Synthesis of No-Wait Cyclic Schedules 5
parameters (e.g. fixed structure and operation times). The most frequently used are:
graph models, in particular including directed graphs [12, 23, 27]; models using
mathematical programming [7, 26, 27, 32], Petri nets [7, 14, 28], max-plus algebra [7],
and constraint programming models [10, 11]. Among many methods the most
important are: the critical path method [12, 24, 27], constraint programming method
[10, 11], methods using different variants of Tabu search metaheuristics [12, 26, 27],
methods using genetic algorithms [2], as well as variants of branch and bound method
[2, 32]. Complementing these methods is a computer simulation that allows rapid
prototyping and analysis of solutions [24, 25].
Known cyclic scheduling methods allow to solve problems of analysis consisting in
the construction of acceptable cyclic schedules, meeting the constraints for various
variants of flow-shop and job-shop systems, having fixed parameters [24, 32]. In this
work, the reverse problem is considered, consisting in determining (synthesis) system
parameters of cyclic processes (repetitive tasks) with a given configuration, which
guarantee the existence of a cyclic schedule that meets the problem (e.g. no blocking,
no waiting for resources, executing tasks with fixed periods). In the cyclic scheduling
literature, there are few approaches to solving the problem of synthesizing system
parameters, aimed at the system meeting specific properties. The existing, few ana-
lytical approaches concern only the synthesis of simple systems composed of several
processes sharing one resource [4, 29].
In this context, the main achievement of the work is the method of synthesis of
operation times and determination of start times of concurrent processes with cascade-
like (chain-like) topology [4, 8, 33], see Fig. 1, for which there is a no-wait cyclic
schedule.
r15 r27 r39
r21 r31
c1=9 c2=6 c3=12
r11 r32
r12 r22
r16 r28 r3(10)
rij – operation time ci – cycle time

Pi – cyclic process Rk – resource
Fig. 1. An example of the extended cascade-like system.

6 R. Wójcik et al.
1.1 System Description

The system of processes with a cascade-like structure has been defined in a classical
form in the works [4, 8, 31, 33]. It consists of the sequences of connected two-process
subsystems (2-P), each of which contains two cyclic processes sharing one resource
(Fig. 2) [3, 14]. The individual 2-P subsystems (Pi, Pj) connect using a shared resource
R, which is used by processes in the mutual exclusion mode, creating a system with a
chain-like topology, i.e. chain-like system (CS). The system defined in this work,
designated as the CS-E system, is an extension of the classical CS system [4, 8, 31],
because it takes into account more than two operations within each cyclic process
(Fig. 1) included in the cascade. In practice, the CS-E system can represent a transport
system consisting of AGVs that move cyclically along routes composed of sectors of
the production system. In this case, the trolleys are cyclic processes and the sectors
belonging to the trolleys routes represent shared resources, which can be blocked by the
processes.
ci cj
Oi=Ri1 R=Ri2=Rj1 Oj=Rj2
oi=ri1 ri=ri2 rj=rj1 oj=rj2
rij – operation time ci – cycle time Pi – cyclic process

ri – time of using a shared resource R
oi – time of using a non-shared resource Oi
Fig. 2. A basic system of two processes (2-P) sharing one resource.
Despite the resources being blocked by the processes under consideration, the CS-E
system is a structurally deadlock-free one, as there will never be a state in which a cycle
of process requests exists such that none of the requests can be realized. The CS-E
system with no process waiting for beginning of any operation will reach a steady state
[8, 31, 33] with a cycle time equal to the least common multiple (lcm) of cycle times of
component processes.
In this work, the CS-E system is considered, in which cycle times of repetitive
processes forming a cascade are set. The times of operations performed by processes
are sought and the start times of processes for which there exist no-wait cyclic
schedules. The developed method of synthesis of no-wait cyclic schedules enables
determination of appropriate operation times for each 2-P subsystem of the cascade. It
uses the known necessary and sufficient conditions [29–31] for the existence of no-wait
cyclic schedules for a basic 2-P system composed of two cyclic processes sharing one
resource (Fig. 2), each of which performs two operations (one with the shared resource
and the other with non-shared, local resource). In this paper the existing conditions
have been implemented for the 2-P component subsystems, creating a new type of
cascade-like system CS-E, in which each process can perform more than two opera-
tions. The obtained constraints were used to carry out the task of no-wait cyclic
schedules synthesis.
1.2 Content of the Sections

In Sect. 2 a model of the extended cascade-like system (CS-E system) of concurrent
repetitive processes is presented. Section 3 defines a problem of determining the
operation and start times of the processes that guarantee the existence of no-wait cyclic
schedules for CS-E systems with fixed periods of the processes. The conditions for no-
wait execution of the simple 2-P subsystem are transformed into the new necessary and
sufficient conditions for no-wait execution of the CS-E system. Section 4 contains a
procedure enabling the synthesis of the CS-E system parameters for which no-wait
cyclic schedules exist. Finally, the conclusions are presented in Sect. 5.
2 Model of the Extended Cascade-Like System
The cascade-like system behaviour (Fig. 1) depends on dynamics of subsystems

composed of two processes sharing a resource [3, 4]. Hence, a CS-E system of
repetitive processes ðP1 ; . . .; Pi ; . . .; Pn Þ, ði ¼ 1; 2; . . .; nÞ, can be seen as composed of
2-P (Fig. 2) subsystems (Pi, Pj) sharing the resource R ¼ Ri2 ¼ Rj1 , i.e. ððP1 ; P2 Þ;

ðP2 ; P3 Þ; . . .; Pi ; Pj ; . . .; ðPn1 ; Pn ÞÞ, where ði ¼ 1; . . .; n 1; j ¼ i þ 1Þ. Each cyclic
process Pi ði ¼ 1; 2; . . .; nÞ (Fig. 3), executes periodically a sequence of operations
using resources Zi ¼ Ri1 ; Ri1ð1Þ ; . . .; Ri1ðaðiÞÞ ; Ri2 ; Ri2ð1Þ ; . . .; Ri2ðbðiÞÞ , where Ri2 =
Rj1 = R(i+1)1, for ði ¼ 1; . . .; n 1Þ; Ri1 ; Ri2 ; RijðkÞ 2 RE, a(i) – number of resources
between Ri1 and Ri2, b(i) – number of resources between Ri2 and Ri1, and RE ¼
fR1 ; . . .; Rk ; . . .; Rlr g is a set of resources, each one of unit capacity (i.e. only one
process can use the resource at any time), lr – a number of resources. In particular,
there can be no resources between Ri1 and Ri2, as well as between Ri2 and Ri1, which
corresponds to the case of the classical cascade-like system [4, 8, 9], Fig. 2. The
operations times are given by a sequence ZTi ¼ ri1 ; ri1ð1Þ ; . . .; ri1ðaðiÞÞ ; ri2 ; ri2ð1Þ ; . . .;
ri2ðbðiÞÞ Þ, and a cycle time of the process Pi is equal to ci ¼ ri1 þ ri1ð1Þ þ . . . þ
ri1ðaðiÞÞ þ ri2 þ ri2ð1Þ þ . . . þ ri2ðbðiÞÞ , where ri1, ri2, rij(k) 2 N are defined in the uniform
time units (N - set of natural numbers). For instance the CS-E system shown in Fig. 1
consists of ten resources and three cyclic processes. The resources R2, R3 are shared
ones, since each one is used by two processes, and the resources R1, R4, R5, R6, R7, R8,
R9, R10, are non-shared resources because each one is exclusively used by only one
process. The processes P1, P2, P3 are executing operations using resources given by the
sequences: Z1 = (R11, R11(1), R12, R12(1)) = (R1, R5, R2, R6), Z2 = (R21, R21(1), R22, R22
(1)) = (R2, R7, R3, R8), Z3 = (R31, R31(1), R32, R32(1)) = (R3, R9, R4, R10). Process cycle
times are equal to: c1 = r11 + r15 + r12 + r16 = 9, c2 = r21 + r27 + r22 + r28 = 6,
c3 = r31 + r39 + r32 + r3(10) = 12. The CS-E system is composed of two 2-P subsys-
tems of cyclic processes sharing a resource: S2 = (P1, P2) – sharing resource R2, and
8 R. Wójcik et al.
ci cj
Ri1* Ri1 Ri2=Rj1 Rj2 Rj2*
ri1* ri2 rj1 rj2*
Pi – cyclic process rij – operation time ci – cycle time

Ri1* – virtual local resource of Pi Rj2* – virtual local resource of Pj
Fig. 3. An extended system of two processes sharing a resource.
S3 = (P2, P3) – sharing resource R3 (where an index i of the Si denotes a number of the
shared resource Ri).
It can be noticed that is possible to analyse behaviour of each (Pi, Pj) subsystem of
two processes sharing a resource, where ði ¼ 1; 2; . . .; n 1; j ¼ i þ 1Þ, separately to
find the operation times and start times of the processes for which no-wait cyclic
schedules exist. It was shown, that dynamics of 2-P systems (Pi, Pj) depends on the
operation times, periods, and start times of the processes [3, 4, 29, 31]. The necessary
and sufficient conditions for existence of no-wait cyclic schedule for a basic 2-P system
(Fig. 2) can be used to find parameters (i.e. operation and start times of the processes)
of the extended 2-P system with several local resources (see Fig. 3), that guarantee
existence of its no-wait cyclic schedule. If we assume that a start time of using a shared
resource by Pi is such that ai(0) = 0, then using the formulas presented in [29–31] it is
possible to calculate (if exist) all start times aj ð0Þ 2 ½0; ci Þ of using the shared resource
by process Pj, that belong to a no-wait cyclic schedule of the extended 2-P subsystem
(Fig. 3). We can repeat the computations for all (Pi, Pj) subsystems, where
ði ¼ 1; 2; . . .; n 1; j ¼ i þ 1Þ, to obtain operation and start times of the processes of
cascade-like (CS-E) system (Fig. 1).
In the following section we will consider a problem of CS-E system parameters
synthesis for which no-wait cyclic schedules exist.
3 Problem Formulation

Let us consider a CS-E system of cyclic process ðP1 ; P2 Þ; . . .; Pi ; Pj ; . . .;
ðPn1 ; Pn ÞÞ, where ði ¼ 1; . . .; n 1; j ¼ i þ 1Þ and its component 2-P subsystem
SR = (Pi, Pj), that consists of two cyclic processes sharing an R resource (Fig. 1). We
assume that Pi and Pj execute periodically a sequence of operations using resources
Zi ¼ ðRi1 ; Ri2 Þ ¼ ðOi ; RÞ, and Zj ¼ Rj1 ; Rj2 ¼ R; Oj , respectively, where Oi = Ri1,
Oj = Rj2 denote the non-shared resources used by the processes. Suppose that the
processes start from the operations using the shared resource R = Ri2 = Rj1. The
operations times are given by a sequence ZTi ¼ ðri1 ; ri2 Þ ¼ ðoi ; ri Þ, and ZTj ¼

rj1 ; rj2 ¼ rj ; oj , where oi ¼ ri1 ; ri ¼ ri2 ; rj ¼ rj1 ; oj ¼ rj2 , and ri ; oi ; rj ; oj 2 N.A
cycle times of Pi and Pj are defined as ci = ri1 + ri2 = oi + ri, and cj = rj1 + rj2 =
rj + oj. It is possible to design recurrent modulus equations defining times at which Pj
can request access to the shared resource R in relation to the allocation time of this
resource to the process Pi [29–31]. These times will be denoted as tij(l), for subsequent
l = 0, 1, …, and will be used as local start times of the process Pj in relation to a start
time of process Pi in the time interval of length ci (Fig. 4).
tij(l)
ri = ri2 oi = ri1
t
ai(k) rj = rj1 oj = rj2 ai(k)+ci
aj(l) aj(l)+cj
Fig. 4. A local start time tij(l) of process Pj in the time interval of length ci.
Assuming that the cycle time ci of each process Pi is known, the problem is to
determine for each subsystem Pi ; Pj ; ði ¼ 1; . . .; n 1; j ¼ i þ 1Þ, that is part of the
cascade-like system CS-E, process operation times for which there are local process
start times, guaranteeing the existence of a no-wait cyclic schedule for the CS-E
system.
3.1 Start Times of Processes in the Basic 2-P System

Let us consider a basic 2-P system of processes (Pi, Pj) sharing a resource (Fig. 2) and
assume that ai(l), aj ðlÞ 2 N [ f0g; l ¼ 0; 1; 2; . . .; denote times at which Pi, Pj receive
access to the shared resource R. Suppose that a start time aj(0) of the process Pi is equal
to ai(0) = 0, and a start- time of the process Pj is such that aj ð0Þ 0. In case when the
processes cannot wait for the shared resource R they can be seen as executed inde-
pendently of each other (no sharing of resources). Hence, subsequent allocation times
ai(l), aj(l) can be calculated according to the equation: aj(l + 1) = aj(l) + cj = aj(0) +
l cj, where (l = 0, 1, 2, …), see Fig. 4.
Let tij ðlÞ 2 N [ f0g define a local start time tij(l) 2 [0, ci) (Fig. 4) of process Pj. It
can be noticed that in order to avoid waiting for the shared resource by Pj in each time
interval of length ci, that begins at ai(k), there must be ri tij ðlÞ, for l = 0, 1, 2, ….,
and to avoid waiting by process Pi, the following should hold: tij ðlÞ ci rj (Fig. 4).
From our previous works [29–31] it follows that local start times tij(l) 2 [0, ci) of
process Pj, defined in relation to resource allocation times of process Pi, with cycle time
ci, are given by the following formula:
10 R. Wójcik et al.
tij ðlÞ ¼ aj ðlÞmod ci ¼ fij ðlÞDij þ yij ðlÞ & l ¼ 0; 1; 2; . . . ð1Þ
where:
aj ð0Þ; j 2 f1; 2; . . .; ng - is given; gcd - the greatest common divisor;

Dij ¼ Dji ¼ gcd ci ; cj & ci ¼ Dij mij & cj ¼ Dji mji & gcd mij ; mji ¼ 1 & mij ; mji 2 N ;
fij ðlÞ ¼ ½fij ð0Þ þ l mji mod mij & yij ðlÞ ¼ yij ð0Þ;
tij ð0Þ ¼ aj ð0Þ mod ci & fij ð0Þ ¼ tij ð0Þ div Dij & yij ð0Þ ¼ tij ð0Þ mod Dij ;

0 fij ð0Þ\mij & 0 yij ð0Þ\Dij ; i:e: fij ð0Þ 2 0; . . .; mij 1 ; yij ð0Þ 2 0; . . .; Dij 1 .

Let Wij ¼ 0; . . .; mij 1 . From fij ðlÞ ¼ ½fij ð0Þ þ l mji mod mij (1) it follows
that a range of fij(l) is such that fij ðlÞ 2 Wij . It can be shown [29, 31], that fij(l) achieves
periodically, with period mij, all values from the set Wij, i.e. fij ðlÞ ¼ fij ðl þ k mij Þ for
k ¼ 0; 1; 2; . . .; and l ¼ 0; . . .; mij 1. Therefore, function fij(l) defines permutation

fij ¼ fij ð0Þ; fij ð1Þ; . . .; fij mij 1 on the set Wij.
Hence, a no-wait cyclic schedule exists for a given (Pi, Pj) system if there are local
start times tij(l) (1) such that relations:
ri tij ðlÞ ci rj ð2Þ

hold for all l 2 Wij, where Wij ¼ 0; . . .; mij 1 . If we take into account notation of
operation times used for CS-E system (see Figs. 2 and 4), where ri = ri2 and rj = rj1,
and relation (1) for values of fij(l) = 0 and fij(l) = mij − 1, the following formula holds:
ri2 tij ðlÞ ci rj1 iff ri2 yij ð0Þ Dij rj1 ð3Þ
We will use these relations to calculate operation and start times of the processes
for which no-wait cyclic schedules exists for the CS-E system.
3.2 System CS-E Parameters that Meet the No-Wait Constraints

It can be noticed that any value yij(0) (3) exists if the interval [ri2, Dij − rj1] is not
empty. i.e. when ri2 Dij – rj1. Taking into account relations 1 ri2 and 1 rj1
the necessary and sufficient condition for existence of a no-wait cyclic schedule for a
basic system (Pi, Pj), where j = i + 1, can be given:
2 ri2 þ rj1 Dij ; i:e: 2 ri2 þ rði þ 1Þ1 Diði þ 1Þ ð4Þ
Hence, the following theorem holds.

Theorem 1. A no-wait cyclic schedules can be constructed for a basic 2-P system
(Pi, Pj) (Fig. 2) with fixed cycle times ci, cj of the processes, if and only if there exist
the operation times ri1, ri2, rj1, rj2 2 N and local start times tij ð0Þ 2 ½0; ci Þ; such that

t ð0Þ ¼ fij ð0ÞDij þ yij ð0Þ (1), and fij ð0Þ 2 0; . . .; mij 1 (1), and yij ð0Þ 2
ij
ri2 ; . . .; Dij rj1 (3), and 2 ri2 þ rj1 Dij (4), where ci = ri1 + ri2, and cj = rj1 +
rj2, and Dij = gcd(ci, cj).
In the basic 2-P system (Pi, Pj) each process Pi is executing periodically sequence of
two operations using resources Zi = (Ri1, Ri2). On the other hand, each process
belonging to the cascade-like system CS-E can perform additional operations using
specific resources, i.e. Zi = (Ri1, Ri1(1), …, Ri1(a(i)), Ri2, Ri2(1), …, Ri2(b(i))), see Fig. 1.
Let (Pi, Pj) be an extended 2-P system (Fig. 3) that is part of the CS-E system. In order
to determine the parameters of the CS-E system, guaranteeing the existence of a no-
wait schedule, we will apply for each extended subsystem (Pi, Pj) necessary and suf-
ficient conditions defined in the form of Theorem 1 for the basic system. For the Pi
process belonging to the extended system (Pi, Pj) we define the virtual resource Ri1*,
which includes all resources used by the Pi process without the Ri2 resource, i.e.
Ri1* = (Ri2(1), …, Ri2(b(i))), Ri1, Ri1(1), …, Ri1(a(i))), see Fig. 3. The resource Ri1* cor-
responds to the resource Ri1 in the basic system shown in Fig. 2, and the time of the
virtual operation using this resource is equal to the sum of operation times using its
component resources, i.e. ri1* = (ri2(1) + … + ri2(b(i)) + ri1 + ri1(1) + … + ri1(a(i))).
Similarly, for the Pj process we define the virtual resource Rj2*, which includes all
resources used by the Pj process without the Rj1 resource, i.e. Rj2* = (Rj1(1), …, Rj1(a(j)),
Rj2, Rj2(1), …, Rj2(b(j))), see Fig. 3. The resource Rj2* corresponds to the resource Rj2 in
the basic system shown in Fig. 2. Then, the necessary and sufficient conditions for the
existence of no-wait cyclic schedules of the CS-E system, which consists of extended
subsystems (Pi, Pj), i = 1,…, n − 1; j = i + 1, and using virtual resources Ri1* and Rj2*
(Fig. 3) defines the following theorem.
Theorem 2. A no-wait cyclic schedules can be constructed for the CS-E system
composed of 2-P subsystems ((P1, P2), …, (Pi, Pj), …, (Pn−1, Pn)) with fixed cycle
times c1, c2, …, ci, cj, …, cn−1, cn of the processes, if and only if for each subsystem
(Pi, Pj), i = 1,…, n − 1; j = i + 1, there exist the operation times ri1 ; ri2 ; rj1 ; rj2 2 N
and local start times tij ð0Þ 2 ½0; ci Þ, such that tij ð0Þ ¼ fij ð0ÞDij þ yij ð0Þ (1), and fij ð0Þ 2

0; . . .; mij 1 (1), yij ð0Þ 2 ri2 ; . . .; Dij rj1 (3), and 2 2 ri2 þ rj1 Dij (4), where:
ci ¼ ri1 þ ri2 ; cj ¼ rj1 þ rj2 , and ri1 ¼ ri2ð1Þ þ . . . þ ri2ðbðiÞÞ þ ri1 þ ri1ð1Þ þ . . . þ

ri1ðaðiÞÞ Þ, and rj2 ¼ rj1ð1Þ þ . . . þ rj1ðaðjÞÞ þ rj2 þ rj2ð1Þ þ . . . þ rj2ðbðjÞÞ , and rkl ; rpqðsÞ 2
N, and Dij = gcd(ci, cj).
If it is possible to construct a no-wait cyclic schedule for the CS-E system, then its
cycle time is equal to T ¼ lcmðc1 ; . . .; ci ; . . .; cn Þ.
Using conditions given by Theorem 2 we can consider a problem of determining
parameters of the extended cascade-like system, i.e. operation and start times of the
processes for which no-wait cyclic schedules exists.
4 Synthesis of No-Wait Cyclic Schedule Parameters
Let us consider a CS-E system (Fig. 1) of processes ðP1 ; . . .; Pi ; Pi þ 1 ; . . .; Pn Þ with set

cycle times ðc1 ; . . .; ci ; ci þ 1 ; . . .; cn Þ. The CS-E system can be seen as composition
ððP1 ; P2 Þ; . . .ðP1 ; PI þ 1 Þ; . . .; ðPn1 ; Pn ÞÞ of 2-P extended subsystems, where
i = 1, …, n − 1. Our goal is to synthesize process operation times and their start times
that satisfy the conditions of Theorem 2. We calculate the vector D ¼ ðD12 ; . . .;
Diði þ 1Þ ; . . .; Dðn1Þn Þ such that Di(i+1) = gcd(ci,ci+1) and then determine the permissible
operating times ri2 ; rði þ 1Þ1 2 N meeting the constraints (4). Let siði þ 1Þ ¼ ri2 þ rði þ 1Þ1 ,

where siði þ 1Þ 2 2; . . .; Diði þ 1Þ . If we assume that ri2 = d, then it must be

ri2 ; rði þ 1Þ1 2 SRiði þ 1Þ , and SRiði þ 1Þ ¼ f d; siði þ 1Þ d : d 2 1; . . .; Diði þ 1Þ 1

& siði þ 1Þ 2 2; . . .; Diði þ 1Þ & iði þ 1Þ d 1g. Hence, the vector csr ¼

ðr12 ; r21 Þ; . . .; ri2 ; rði þ 1Þ1 ; . . .; rðn1Þ2 ; rn1 , which takes into account all subsys-
tems (Pi,Pi+1), for i = 1, …, n − 1, and meets restrictions 4, belongs to the Cartesian
product SR ¼ SR12 x. . .xSRiði þ 1Þ x . . .xSRðn1Þn Þ, i.e. csr 2 SR. We may notice that the
number of elements of the SRi(i+1) set is the sum of the items
in the
1; . . .; Diði þ 1Þ 1 , i.e. SRiði þ 1Þ ¼ 1 þ 2 þ . . . þ Diði þ 1Þ 1 . Therefore,
jSRj ¼ jSR12 j . . . SRiði þ 1 . . . SRðn1Þn Þ is the number of all possible vectors csr
that satisfy constraints (4). However, as acceptable process operation times, we can
only accept values of the operation times given by csr ¼ ð ðr12 ; r21 Þ; . . .;
ri2 ; rði þ 1Þ1 ; . . .; rðn1Þ2 ; rn1 Þ for which it is possible to find operation times
rkl ; rpqðsÞ 2 N, such that constraints ci = ri1* + ri2, and ri1 ¼ ðri2ð1Þ þ . . . þ
ri2ðbðiÞÞ þ ri1 þ ri1ð1Þ þ . . . þ ri1ðaðiÞÞ Þ hold, for i = 1,…,n. After setting the operation
times of the processes, we can define the permissible values of local process start times
belonging to no-wait cyclic schedules using formula tij ð0Þ ¼ fij ð0ÞDij þ yij ð0Þ (1), and

fij ð0Þ 2 0; . . .; mij 1 (1), yij ð0Þ 2 ri2 ; Dij rj1 (3). Example 1 illustrates the
presented method of synthesizing parameters of CS-E systems.
Example 1. As shown in Fig. 1, the CS-E system considered consists of n = 3 pro-
cesses P1, P2, P3 that are executing operations using resources given by the sequences:
Z1 = (R11, R11(1), R12, R12(1)) = (R1, R5, R2, R6), Z2 = (R21, R21(1), R22, R22(1)) = (R2,
R7, R3, R8), Z3 = (R31, R31(1), R32, R32(1)) = (R3, R9, R4, R10). Process cycle times are
equal to: c1 = r11 + r15 + r12 + r16 = 9, c2 = r21 + r27 + r22 + r28 = 6, c3 = r31 +
r39 + r32 + r3(10) = 12. The CS-E system is composed of two 2-P extended subsystems
((P1,P2), (P2,P3)), i.e. (P1,P2) – sharing resource R2, and (P2,P3) – sharing resource R3.
The following relations hold (1): D12 ¼ D21 ¼ gcd ðc1 ; c2 Þ ¼ 3; m12 ¼ 3; m21 ¼ 2, and
c1 ¼ D12 m12 ; c2 ¼ D21 m21 ; D23 ¼ D32 ¼ gcd ðc2 ; c3 Þ ¼ 6; m23 ¼ 1; m32 ¼ 2, and c2 ¼
D23 m23 ; c3 ¼ D32 m32 . Hence, s12 = r12 + r21, and s12 2 f2; . . .; D12 g ¼ f2; 3g, as well
as s23 = r22 + r31, and s23 2 f2; . . .; D23 g ¼ f2; 3; 4; 5; 6g. The vector of acceptable
operation times has a form: csr = ((r12, r21), (r22, r31)), csr 2 SR, where SR = SR12
SR23 = {(d, s12-d): d 2 {1, 2} & s12 2 {2, 3} & s12 − d 1} {(d, s23-d): d
{1, 2, 3, 4, 5} & s23 2 {2, 3, 4, 5, 6} & s23 − d 1} = {(1, 1); (1, 2), (2, 1)}
{ (1, 1); (1, 2), (2, 1); (1, 3), (2, 2), (3, 1); (1, 4), (2, 3), (3, 2), (4, 1); (1 5), (2, 4),
(3, 3), (4, 2), (5, 1)}. The operation times of the no-wait CS-E system must satisfy the
following constraints: ððr12 ; r21 Þ; ðr22 ; r31 ÞÞ 2 SR, and c1 ¼ r11 þ r12 ¼ 9 and
r11 ¼ ðr16 þ r11 þ r15 Þ, and c2 ¼ r21 þ r22 ¼ 6, and r21 ¼ ðr28 þ r21 þ r27 Þ, and
c3 ¼ r31 þ r32 ¼ 12, and r31 ¼ r3ð10Þ þ r31 þ r39 . Let us select a vector ((r12, r21),
(r22, r31)) from the SR set, e.g. ((r12, r21), (r22, r31)) = ((2, 1), (3, 1)) - selected elements
were underlined. Hence, the remaining operation times must meet the constraints:
c1 r12 ¼ r11 ¼ ðr16 þ r11 þ r15 Þ ¼ 7, and c2 r22 ¼ r21 ¼ ðr28 þ r21 þ r27 Þ ¼
ðr28 þ 1 þ r27 Þ ¼ 3, and c3 ¼ r31 þ r32 ¼ r3ð10Þ þ r31 þ r39 þ r32 ¼ r3ð10Þ þ

1 þ r39 Þ þ r32 ¼ 12, where ðr16 ; r11 ; r15 Þ; ðr28 ; r27 Þ; r3ð10Þ ; r39 2 N. We may notice
that the only solution is r28 = r27 = 1, and for the remaining operation times, an
example solution was found, assuming the lowest possible values (r16 = r15) = (r3
(10) = r39) = 1. Hence, we obtain r11 = 7 − 2 = 5, and r32 = 12 − 3 = 9. Finally, the
possible operation times of the CS-E system for which there are no-wait cyclic
schedules are as follows: ZT1 = (r11, r15, r12, r16) = (5, 1, 2, 1), ZT2 = (r21, r27, r22,
r28) = (1, 1, 3, 1), ZT3 = (r31, r39, r32, r3(10)) = (1, 1, 9, 1). Assuming that in subsystem
(P1,P2), processes are started from an operation using the R2 resource, and in subsystem
(P2,P3), from operation using the R3 resource, we can calculate the permissible values
of local process start times belonging to cyclic schedules of the CS-E system composed
of subsystems ((P1,P2), (P2,P3)), by using formulas: t12 ð0Þ ¼ f12 ð0ÞD12 þ y12 ð0Þ (1),
and f12 ð0Þ 2 f0; . . .; m12 1g (1), y12 ð0Þ 2 ½r12 ; D12 r21 (3), as well as t23 ð0Þ ¼
f23 ð0ÞD23 þ y23 ð0Þ (1), and f23 ð0Þ 2 f0; . . .; m23 1g (1), y23 ð0Þ 2 ½r22 ; D23 r31 (3).
Since, D12 = D21 = gcd(c1,c2) = 3, m12 = 3, m21 = 2, and c1 = D12m12, c2 = D21m21;
D23 = D32 = gcd(c2,c3) = 6, m23 = 1, m32 = 2, and c2 = D23m23, c3 = D32m32, we
obtain: t12 ð0Þ ¼ f12 ð0Þ 3 þ y12 ð0Þ (1), and f12 ð0Þ 2 f0; 1; 2g (1), y12 ð0Þ 2 ½2; 2 (3),
and also t23 ð0Þ ¼ f23 ð0Þ 6 þ y23 ð0Þ (1), and f23 ð0Þ 2 f0g ð1Þ; y23 ð0Þ 2 ½3; 5 (3). In
Fig. 5 we see an example of a no-wait cyclic schedule for t12(0) = 2 and t23(0) = 3. Its
cycle time is T ¼ lcmðc1 ; c2 ; c3 Þ ¼ lcmð9; 6; 12Þ ¼ 36:
Fig. 5. Example of a no-wait cyclic schedule for the system (P1, P2, P3) shown in Fig. 1; where
(2, 6, 1, 5) denote numbers of the resources used by the process P1, (2, 7, 3, 8) – by the process
P2, and (3, 9, 4, 10) by the process P3.
5 Conclusions
The problem of synthesis of parameters of repetitive process systems with cascade-like

structure, i.e. operation times and process start times, which guarantee the existence of
no-wait cyclic schedules, was considered. A new class of systems was defined, the so-
called extended cascade-like systems CS-E, in which each process can perform addi-
tional operations in comparison to classical systems with ”chain-like” structure, in
which cyclic processes perform two operations each. Using the known conditions of
the existence of no-wait cyclic schedules in the basic two process system, the necessary
and sufficient conditions for the existence of no-wait cyclic schedules in CS-E systems,
which were applied in the developed procedure of synthesis of parameters of the CS-E
system with set periods of cyclic processes, were formulated in a declarative manner.
The method developed makes it possible to determine whether there is an acceptable
solution in time comparable to the determination of the gcd of process cycle times and
can be used to construct no-wait cyclic schedules for repetitive process systems with
mesh-like structure.
References
1. Abadi, I.N.K., Hall, N.G., Sriskandarajah, C.: Minimizing cycle time in a blocking
flowshop. Oper. Res. 48, 177–180 (2000)
2. AitZai, A., Benmedjdoub, B., Boudhar, M.: A branch and bound and parallel genetic
algorithm for the job shop scheduling problem with blocking. Int. J. Oper. Res. 14(3), 343–
365 (2012)
3. Alpan, G., Jafari, M.A.: Dynamic analysis of timed Petri nets: a case of two processes and a
shared resource. IEEE Trans. Robot. Autom. 13(3), 338–346 (1997)
4. Alpan, G., Jafari, M.A.: Synthesis of sequential controller in the presence of conflicts and
free choices. IEEE Trans. Robot. Autom. 14(3), 488–492 (1998)
5. Allahverdi, A.: A survey of scheduling problems with no-wait in process. Eur. J. Oper. Res.
255(3), 665–686 (2016)
6. Aschauer, A., Roetzer, F., Steinboeck, A., Kugi, A.: An efficient algorithm for scheduling a
flexible job shop with blocking and no-wait constraints. IFAC-PapersOnLine 50(1), 12490–
12495 (2017). 20th IFAC World Congress
7. Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.-P.: Synchronization and Linearity (An
Algebra for Discrete State Systems). Wiley, Chichester (1992)
8. Banaszak, Z., Jędrzejek, K.: On self-synchronization of cascade-like coupled processes.
Appl. Math. Comput. Sci. 3(4), 39–60 (1993)
9. Banaszak, Z., Krogh, B.: Deadlock avoidance in flexible manufacturing systems with
concurrently competing process flows. IEEE Trans. Robot. Autom. 6(6), 724–734 (1990)
10. Bocewicz, G., Nielsen, I., Banaszak, Z.: Automated guided vehicles fleet match-up
scheduling with production flow constraints. Eng. Appl. Artif. Intell. 30, 49–62 (2014)
11. Bocewicz, G., Wójcik, R., Banaszak, Z., Pawlewski, P.: Multimodal processes rescheduling:
cyclic steady states space approach. Math. Probl. Eng. (2013). http://dx.doi.org/10.1155/
2013/407096
12. Bożejko, W., Pempera, J., Wodecki, M.: Minimal cycle time determination and golf
neighborhood generation for the cyclic flexible job shop problem. Bull. Pol. Acad. Sci. Tech.
Sci. 66(3), 333–344 (2018)
13. Brucker, P., Kampmeyer, T.: Cyclic job shop scheduling problems with blocking. Ann.
Oper. Res. 159(1), 161–181 (2008)
14. Gaujal, B., Jafari, M., Baykal, G.-M., Alpan, G.: Allocation sequences of two processes
sharing a resource. IEEE Trans. Robot. Autom. 11(5), 748–753 (1995)
15. Gold, E.: Deadlock prediction: easy and difficult cases. SIAM J. Comput. 7, 320–336 (1978)
16. Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and
no-wait in process. Oper. Res. 44(3), 510–525 (1996)
17. Krenczyk, D., Kalinowski, K., Grabowik, C.: Integration production planning and
scheduling systems for determination of transitional phases in repetitive production. In:
Hybrid Artificial Intelligent Systems. LNCS, vol. 7209, pp. 274–283 (2012)
18. Kamoun, H., Sriskandarajah, C.: The complexity of scheduling jobs in repetitive
manufacturing systems. Eur. J. Oper. Res. 70, 350–364 (1993)
19. Kumar, S., Bagchi, T.P., Sriskandarajah, C.: Lot streaming and scheduling heuristics for m-
machine no-wait flowshops. Comput. Ind. Eng. 38, 149–172 (2000)
20. Lawley, M., Reveliotis, S.: Deadlock avoidance for sequential resource allocation systems:
hard and easy cases. Int. J. Flex. Manuf. Syst. 13(4), 385–404 (2001)
21. Levner, E., Kats, V., Alcaide, D., Pablo, L., Cheng, T.C.E.: Complexity of cyclic scheduling
problems: a state-of-the-art survey. Comput. Ind. Eng. 59(2), 352–361 (2010)
22. Liu, S.-Q., Kozan, E.: Scheduling trains with priorities: a no-wait blocking parallel-machine
job-shop scheduling model. Transp. Sci. 45(2), 175–198 (2011)
23. Louaqad, S., Kamach, O., Iguider, A.: Scheduling for job shop problems with transportation
and blocking no-wait constraints. J. Theor. Appl. Inf. Technol. 96(10), 2782–2792 (2018)
24. Pinedo, M.: Planning and Scheduling in Manufacturing and Services. Springer, New York
(2005)
25. Polak, M., Majdzik, P., Banaszak, Z., Wójcik, R.: The performance evaluation tool for auto-
mated prototyping of concurrent cyclic processes. Fundamenta Informaticae 60(1–4), 269–
289 (2004)
26. Schuster, ChJ: No-wait job shop scheduling: tabu search and complexity of subproblems.
Math. Methods Oper. Res. 63(3), 473–491 (2006)
27. Smutnicki, Cz.: Minimizing cycle time in the manufacturing system based on the flow of
various jobs. IFAC Proc. 42(4), 1137–1142 (2009). 13th IFAC Symposium on Information
Control Problems in Manufacturing
28. Song, J.-S., Lee, T.-E.: Petri net modeling and scheduling for cyclic job shops with blocking.
Comput. Ind. Eng. 34(2), 281–295 (1998)
29. Wójcik, R.: Constraint programming approach to designing conflict-free schedules for
repetitive manufacturing processes. In: Cunha, P.F., Maropoulos, P.G. (eds.) Digital
Enterprise Technology. Perspectives and Future Challenges, pp. 267–274. Springer, New
York (2007)
30. Wójcik, R.: Designing a no-wait cyclic schedule for a class of concurrent repetitive
production processes. IFAC-PapersOnLine 51(11), 1305–1310 (2018). Designing a no-wait
cyclic schedule for a class of concurrent repetitive production processes
31. Wójcik, R.: Towards strong stability of concurrent repetitive processes sharing resources.
Syst. Sci. 27(2), 37–47 (2001)
32. Von Kampmeyer, T.: Cyclic scheduling problems. Ph.D. dissertation,
Mathematik/Informatik, Universität Osnabrück (2006)
33. Zaremba, M.B., Jędrzejek, K.J., Banaszak, Z.A.: Design of steady-state behavior of
concurrent repetitive processes: an algebraic approach. IEEE Trans. Syst. Man Cybern.
Part A Syst. Hum. 28(2), 199–212 (1998)
Another random document with
no related content on Scribd:
“All very well for the smaller girls,” David smiled, “but didn’t you
others rebel?”
“Ah, but I have other clothes,” said Gabrielle, interestedly. “There’s a
lovely countess in Paris, a widow, who is one of the old children——”
“One of the——?”
“Old children. One of the alumnæ of St. Susanna’s,” she elucidated,
laughing at his bewildered look. “That’s what the nuns call them, ‘the
old children.’ And every year this countess takes the graduates and
goes with them to buy suitable clothes—that is, if there aren’t fathers
and mothers to do it for them,” added Gabrielle. “So she took me, the
darling! We all know her quite well, and the last year one may go to
her Sunday afternoon teas four or five times,” explained the girl,
seriously. “That is, if you’ve no devoirs.”
“Devoirs?”
“Penances. Punishments to write for breaking rules,” she said.
“I feel dense. Devoirs, of course,” said David, diverted. “Tell me more
of this. If you had no devoirs you might go to tea with the countess?”
“So that we might comport ourselves becomingly in society,” agreed
Gabrielle. “And then, two weeks before we left for Cherbourg, she
took me into the city, and bought me—oh, lovely things! A velvet
dress; I wore that once on the boat. And a lovely brown lace dress,
and a hat, and a suit, and three blouses. But we had to travel in our
uniforms, of course. ‘Religious in habit. Students in uniform.’ That’s
the rule.”
David was finding this extremely amusing and interesting. Through
the medium of such engaging youth and freshness, such simplicity
and eagerness, almost anything would have been somewhat so. But
this glimpse of girlhood managed so decorously by rule was new to
him, and it contrasted oddly with—well, for example, with Sylvia’s
breezy independence and that of all the other young women he
knew.
“Did you—did any of the girls really like it, Gabrielle?”
“Did——?” The wonderful eyes widened and were more wonderful
than ever. “But we all loved it!” she exclaimed. “We had—fun. The
gardens were perfectly beautiful, and on Sundays there was always
a sweet, and often on Thursdays! Or some girl’s father would send
her a great box of chocolates.”
“You were in Normandy when I was in Paris,” David said, wondering
if he would have thought to send a box of chocolates to St.
Susanna’s if she had been there.
“Normandy! Isn’t it—but you don’t know it!” she said. “It’s heavenly.
We have such a cunning little place there; it was a sort of gate-lodge
once, and of course we had the sea!—it used to remind me of
Wastewater, only of course the sun seemed to set in the wrong
direction!——David,” Gabrielle broke off to ask earnestly, “didn’t you
find Paris very disappointing?”
“Rucker and I were only there ten days, on our way to Spain, to
paint,” David reminded her. “No, I don’t remember that it was exactly
—disappointing,” he added, in a tone that made her laugh.
“To me,” the girl said, “Paris was all Dumas and Victor Hugo and
Stanley Weyman. I like their Paris the best. Sedans, masked riders,
horses waiting in the angles of the walls——It made me almost glad
not to see London,” she added, gravely. “Imagine losing Dickens’s
London, and Thackeray’s, and Trollope’s! Oh, look,” she said, in a
tone rich with affectionate recollection, as they stopped by the old
sundial set in a mouldy circle of emerald grass.
“You still like adventure stories?” David suggested, remembering that
she always had liked them.
“Not always,” Gabrielle answered. And with a suddenly warming
enthusiasm, she recounted to him a story she had read on the boat,
one of a collection of short stories.
It was so simple that it hardly engaged his attention at first: the story
of two rich little girls, with a marvellous doll’s house, and two poor
little girls socially debarred from being asked in to inspect it.
Gabrielle described the minute perfections of the doll’s house, the
tiny beds and curtains, the marvel of a microscopic glass lamp, and
the wistful wonder of the little pariahs, one bold and eager, the other
shy, her little head hanging, her little hand always grasping a corner
of her big sister’s apron. By chance the poor little girls were offered
an opportunity to creep in, and they were rapturously inspecting the
wonder when the rich little girls’ mother indignantly discovered them,
sent them forth with insulting scorn, sent them shamed and
bewildered on their homeward road. And the older child sat by the
roadside, heaving with hurt and fury and heat and fatigue, with the
little sister close beside her. And the simple story ended quite simply
with the little sister’s murmured words of courage and comfort:
“Never mind. I seen the little tiny glass lamp!”
David was an artist, he adored beauty in youth, in words, in voices.
Here he found them all combined in this eager creature who ended
her tale with tears in her glorious eyes and a smile that asked for his
sympathy twitching her splendid mouth. Told so plainly, under the
dreaming autumn sky, in the thinning soft autumn sunlight of the old
garden, the whole thing had a quite memorable pathos and charm,
and when he thought of Gabrielle—as David did often in the days to
come—he always thought of her standing by the sundial in the
morning freshness, telling him the story of the doll’s house.
She had brushed the face of the dial free of leaves and pine needles
and was scraping the deep incisions with a stick.
“Twenty minutes past eight,” she said, tipping her head to read the
time. And afterward she read the inscription in her sweet husky
voice:
“Turn, Flemynge, spin agayne;
The crossit line’s the kenter skein.
“One of my first recollections,” said Gabrielle, “is being down here
with Uncle Roger and Sylvia—I must have been about six, for it was
just before he died. He set us both up on the sundial, and told us it
was older than the Stars and Stripes, that it had come from England
for his grandfather, and what it meant. It meant that the Flemings
were always bringing home wives from overseas and crossing the
line. I remember it,” she added, as they strolled back toward the
house, “because I said—looking out to sea—‘Will Tom have a wife
when he comes home?’ and that pleased Uncle Roger, as anything
did, I suppose,” Gabrielle ended, sighing, “that made Tom’s coming
back at all seem likely!”
“Poor Tom! It would have been a nice inheritance,” David mused. “It
has increased, even since Uncle Roger’s time, you know.”
“Is Sylvia apt to make her home here, David?” Gabrielle asked. “She
sounds rather worldly—that’s a great convent word! But tell me, what
is she like?”
“She is very beautiful, extremely clever, enormously admired,” David
answered, with a little flush. “She has the white Fleming skin, high
colour, shining black hair.”
“A girl off a handkerchief box?” Gabrielle suggested.
“Exactly.”
“And are there admirers?”
“A great many.”
The girl looked a quick question, half smiling, and he answered it
pleasantly:
“Myself among them, of course! But Sylvia can look much higher
than a painter of mediocre pictures.”
“I don’t believe they’re mediocre!” Gabrielle said, stoutly.
“I’ve some at Keyport, most of them are in New York, some on their
way now to an exhibition in Washington,” David said. “When I come
back you must see them, Gay!”
“When you come back——?” Her walk halted.
“I’m off for New York and then Washington this morning.”
“Oh.” It was not a question, not an exclamation. She pronounced the
little monosyllable quietly, resumed her walking. “I like my little old
name!” she presently said, with a glancing smile. And then, with
sudden interest, as they came closer to the house: “David, tell me—
who lives in that wing—up there, on the third floor?”
“Nobody, now. Those are old servants’ rooms; but the servants are
on the other side now—Aunt Flora has only five or six. Hedda’s
cousin is the cook, an old Belgian woman who’s been here—well,
she must have been here several years before you went abroad?”
“Trude?”
“Yes, Trude. Then there’s Maria, the pock-marked one, and a couple
of new ones from Crowchester, sisters named Daisy and Sarah, who
live with John and Etta at the tenant house, out near the stables, and
seem mainly interested in going into Crowchester. John occasionally
employs others to assist him in the garden, his wife helps, I believe,
with the laundry-work, and old Margret comes over from Keyport to
lend a hand now and then. That’s the staff.”
“But look here, David,” said Gabrielle. “You see my open window up
there, with the curtain blowing—and then all those blank windows—
then turn the corner of the court and come out again in the north
wing—up there—there was some light up there last night! I saw it
when my own gaslight blew out. It was unmistakable, coming
through the chinks of shutters! It gave me the creeps for a moment.”
“Reflection!” David said, smiling. “Reflection in glass.”
“No, for my light was out.”
“Reflection of some other window, then.”
“Yes, but whose?”
“I don’t know,” he told her, amused. “You’ll have ample opportunity to
find out, my dear. I’m wondering what you’ll do with yourself, here all
alone with Aunt Flora!”
“I’ll work,” she said, stoutly. But he could see that she herself felt a
little daunted by the prospect. “I’ll practise, and keep up my French,
and take walks into Keyport and Crowchester, and perhaps”—and
she gave him a laughing look—“design all the little rooms and
hallways of houses in beans when it rains!”
“Good Lord!” David said, with a great laugh. “Do you remember my
houses designed in white beans to amuse you and Sylvia on wet
holidays? But you have no special plans for yourself, Gay?” he
asked, more soberly. “Nothing you especially want to do?”
“I talked it over with Sister Borromeo and Sister Alcantara——” she
was beginning, with a faintly worried look, when David laughed
again.
“Are these Pullman cars?”
“No!” said Gabrielle, shocked yet laughing, as they mounted the
three steps to the side door. “They are wonderful nuns. And they
both feel that, under the circumstances, I had better wait and see if
Aunt Flora has any plans or any use for me here!”
“And I think that, too,” David said, heartily, delighted to find her so
reasonable. “You are not yet nineteen, after all, and we’ll find the
happiest solution for you one of these days. I’ll be coming and going
all winter, and Sylvia’ll be home, with a degree, in June. So keep up
your spirits!”
“Ah, don’t worry about me!” she answered, courageously, going in to
breakfast.
CHAPTER V
Three hours later she said good-bye to him composedly at Aunt
Flora’s side. He carried away a pleasant recollection of her, standing
there tall and smiling, with her gray eyes shining. She was a more
than usually interesting type of girl, David mused, going upon his
way, and as the man of the family it behooved him to think out some
constructive line of guidance in her direction. What about an
allowance? Just what would Gabrielle’s status be a year from now,
when Sylvia reached her majority and Aunt Flora no longer
controlled both girls as if their position were equal? Sylvia might
graciously provide for this less fortunate cousin if Sylvia were
properly influenced.
This was October; Sylvia was going with the Montallen girls to
Quebec for a simple family Thanksgiving week-end, but she would
be home for almost three weeks at Christmas time. David must
manage a talk with her then. Perhaps the peculiar embarrassments
and deprivations of Gabrielle’s position had never occurred to Sylvia,
as indeed they never had presented themselves so forcibly to David
before. “She is certainly a stunning creature—character, too,” David
thought. “God help the child, shut up there with Aunt Flora and the
servants, and with Aunt Flora always so curiously hostile to her, at
that! I’ll try to get down there before Christmas—see how it goes!”
And he put the thought of Wastewater behind him, as he usually did
at about this point in his journey toward Boston or New York.
But Gabrielle had found nothing at Wastewater to make her forget
David, and the thought of him lingered with her for many, many days.
They were hard days, these first after her return. Flora was not
visibly unfriendly toward her, and the servants were always
responsive and interested. But Gabrielle was left almost entirely to
her own resources, and after the regular rule of the convent life, the
orderly waxed halls in which the sunshine lay in shining pools, the
low, kindly voices, the chip-chipping of girls’ feet, the cheerful chatter
in the long refectory, the sheltered fragrance of the walled garden,
the girl felt lonely and at a loss for employment.
She aired her bed and ordered her room before breakfast;
descended promptly, commented with Aunt Flora upon the weather.
“What a wind this morning, Aunt Flora!”
“Yes, indeed, and in the night.”
“It didn’t keep you awake, Aunt Flora?”
“Not the wind, no. I am not a good sleeper.”
Then silence; and Daisy or Sarah with the rolls and coffee, to ask in
a low tone:
“Will you have an egg, Mrs. Fleming?”
“I think not, this morning. Perhaps Miss Gabrielle——”
For Gabrielle was not “Miss Fleming” really, although she was used
to the name. Sylvia was that, always. Perhaps Miss Gabrielle would
have an egg; oftener not. There was no deep golden corn bread to
be anticipated here, as a regular Friday morning treat; but
sometimes special muffins or a little omelette came up, and then
Gabrielle always smiled affectionately and said to herself: “Margret’s
here!”
After breakfast every morning she mounted through the large,
gloomy halls to her room, wrote in her diary, went resolutely at her
French or Italian. Then she went down to the square piano and
began with scales, études and nocturnes, sonatinas. When the half-
hour after eleven sounded, usually she went out, down to the shore,
scrambling among the big rocks she remembered so well, watching
this favourite pool or that, as it slowly and solemnly brimmed,
overflowed, drained again.
This side of the shore was in shade now, for Wastewater stood on its
own little jutting point of cliff and forest, and the sun, at autumn
midday, had moved behind the trees. Gabrielle would fall to
dreaming, as she stared across the softly heaving, shining expanse
of the water, her back against a great boulder, her feet, in their rough
little shoes, braced against a smaller one.
Going in to lunch blinking and hungry, the instant effect of closeness,
odorous age, and quiet darkness would envelop her. She would look
with secret curiosity at her aunt’s mottled, dark face. Aunt Flora had
been quietly reading and writing all morning, she would read and
write all afternoon.
Immediately after luncheon came Mrs. Fleming’s one outing of the
day. Sometimes she walked about the borders with John, discussing
changes, her silk skirt turned up over her decent alpaca petticoat,
efficient-looking overshoes covering her congress gaiters if the paths
were damp. Sometimes John brought the surrey, and Aunt Flora and
Gabrielle went into Crowchester to shop. Flora kept a small car, but
she did not like it; she did not even like the cars of others, Gabrielle
discovered, when they honked behind the stout old bay horse on the
roads.
Aunt Flora had acquaintances in Crowchester, but no friends. She
never made calls, or entertained at luncheon or dinner. She bowed
and talked to the minister’s wife when she met her in a shop, she
knew the librarian and the school superintendent, and she belonged,
at least nominally, to the Woman’s Improvement Club. Once, in
December, there was a lecture at the club on the modern British
poets and Flora took Gabrielle, who wore her velvet dress, and was
much flushed and excited and youthfully friendly in the dim, women-
crowded rooms, and who carried away a delightful impression of
Hodgson and Helen Eden and Louise Guiney and tea and cake.
But a week later, when the president of the club sent Gay a card for
a dance to be given by the choicest of Crowchester’s youth that
winter, Flora shook her head. Much better for Gay not to associate
with the village people; Sylvia despised them. It was too easy to
become involved in things that had never been acceptable to
Wastewater. Gabrielle wrote a charming little note of regret.
Flora wrote to Sylvia every three or four days and received delightful
letters from her daughter at least once a week. Sylvia wrote
interestedly of a hundred activities, and Gay’s word for her cousin
came to be, in her own heart, “superior.” Sylvia was assuredly
“superior.” She was still playing golf, for the snows were late, and
basket ball, and squash; she was working for mid-term examinations
in history, philosophy, and economics. She would have sounded
almost formidable if the Thanksgiving letter had not struck a warmer
note: Sylvia was ski-ing, tobogganing, dancing; she had been to a
little home fancy-dress party as “Night”; her letter was full of
delightful allusions to young men, “Bart Montallen, who is in
diplomacy,” a charming Gregory Masters, and a “dear idiotic cousin
of Gwen’s, Arthur Tipping, who will be Lord Crancastle some day, in
all probability—but all such simple people and not rich!” Some of
these might come down to Wastewater for a few days before
Christmas. Gabrielle’s heart leaped at the mere thought.
Gabrielle sometimes wondered what Flora wrote to Sylvia in those
long, closely lined letters that went so regularly from Wastewater.
Flora would sit scratching at her desk in the upstairs sitting room,
look away thoughtfully, begin to scratch again. Sometimes Gabrielle
saw her copying long excerpts from books; indeed, Flora not
infrequently read these aloud to her niece, a thought from some
bishops’ letters from the Soudan, lines from “Aurora Leigh” or “Lady
Clare.”
These were almost all gift books, bound in tooled leather and gilded,
with gilded tops. The old house was full of gift books. Gabrielle
imagined the last generation as giving its friends large, heavy, badly
bound, or at least insecurely bound, books on all occasions, “The
Culprit Fay,” “Evangeline,” and “Hiawatha,” Flaxman’s gracious
illustrations for Schiller’s “Bell,” Dante with the plates of Doré.
Idly she dipped into them all, idly closed them. Sometimes in the
long wintry afternoons she opened the lower drawers of the
bookshelves and looked at all the stereoscope pictures of Niagara,
and Japan with wistaria falling over arbours, and Aunt Flora and Lily,
Gabrielle’s own slender mother, in riding habits, with long veils
flowing from their black silk hats. The tiny figures stood out in bold
relief, the flowers seemed to move in the breezes of so many years
ago; there was a Swiss mountain scene that Gabrielle had loved all
her life, with a rough slab of drift almost in the very act of coasting
upon the road where men and Newfoundland dogs were grouped.
Her hardest time was when the decorous afternoon excursion or
walk was over, at perhaps four o’clock. Dinner was at seven; the
winter dusk began to close down two and a half hours before dinner.
The girl could not with propriety walk far from the house in the dark,
even if she had cared to traverse the cliff roads at night. The
servants were far downstairs, all elderly in any case. Aunt Flora
hated young servants.
Sometimes she went to the piano and would find herself meandering
through an old opera score, “Traviata” or “Faust.” Sometimes, if the
afternoon was clear, she walked rapidly to Keyport and rapidly back.
Many an afternoon, as long as the light lasted, she prowled about
within the confines of Wastewater itself, for besides the always
fascinating half-mile of shore there were the cliffs, the woods back of
the house, and all the stable yards, cow yards, chicken yards, all the
sheds and fences, the paddocks and lanes, the gates and walls that
almost two hundred years of homekeeping had accumulated. The
big stables were empty now except for one or two dray horses, the
sturdy bay that dragged the old surrey, and a lighter horse that Sylvia
—Gabrielle learned—sometimes used for riding. There was perhaps
one tenth of the hay stored that the big hay barn would
accommodate, one tenth of the grain. There were two cows,
chickens, pigeons; there were intersecting catacombs of empty
rooms and lofts and sheds where apples were left to ripen, or where
feathers fluffed at the opening of a door, or where cats fled like
shadows. Towering above all, among towering pear trees, there was
the windmill, still creaking, splashing, leaking.
John the gardener had a substantial brick house, a nice wife, and a
stolid little girl of fourteen who walked the three miles every day to
the Union High School between Tinsalls and Crowchester. Gabrielle
presently gathered that young Etta was taking two fifty-cent music
lessons every week in Crowchester, and that she was going to be a
school teacher. Her “grammer” lived in Crowchester, and when the
weather got very bad Etta and her mother sometimes stayed with
“grammer,” and Uncle Dick drove her to school, and she and her
cousin Ethel went to the movies every night.
Wastewater itself might have filled many a lonely afternoon, for there
were plenty of unused rooms worthy of exploring. But Gabrielle had
small heart for that. There was something wholesome and open
about the garden and the stable yards and the sea, but the big
closed rooms inside filled her with a vague uneasiness.
The girl would look up at them from outside when the winter sunsets
were flaming angrily behind the black etched branches of the bare
trees; look up at blank rows of shuttered windows, identify her own,
Aunt Flora’s, the upstairs sitting room with gaslight showing pink
through the shutters when the cold clear dusk fell; the dining room,
with Daisy pulling the rep curtains together.
These were human, used, normal, but there were so many others!
Two thirds of the entire lower floor was always sealed and dark,
showing from outside only solemn bays, and flat surfaces screened
heavily in shrubs and bushes. In the western wing, with hooded
windows rising only two or three feet above the old walk, were the
kitchen windows; but the older servants, Hedda and Maria and the
cook, Trude, had rooms obscurely situated somewhere far back of
Aunt Flora’s rooms and Sylvia’s room and the upstairs sitting room
on the second floor. Gabrielle’s room was on the third floor, and
David’s, and the rooms still kept ready for Tom; these were all that
were used of some score of rooms on that level, and Wastewater
rose to a mansard as well, to say nothing of the cupola that rose for
two floors, and was finished off with columns and a small circular
room of glass, high above the tops of the highest trees. Gabrielle
remembered when she and Sylvia used to think it a great adventure
to creep up there and look down upon a curiously twisted landscape,
with all the familiar barns and fences in the wrong places, and so
little land, cut by such insignificant ribbons of roads, and so much
sea, broken by nothing at all!
“You could put a hundred people in here!” Gabrielle used to think. In
the days of its glory, Uncle Roger had told them more than once,
there had often been half that number at Wastewater.
All the sadder to find it so empty now, the girl would muse,
wandering through the quiet halls. If the winter sun were shining
bright, sometimes she opened the great double doors that shut off
the end of the dining-room hall, and penetrated, with a fast thumping
heart and nervously moving eyes, into what had been the boasted
ballroom, billiard room, library, drawing rooms of the house.
In this section was the unused front stairway; curved, enormous,
wheeling up from a great square hall. There were doors on all sides,
decorous heavy doors, all closed. Beyond them, Gabrielle’s peeping
eyes found great silent rooms, whose crystal-hung chandeliers
tinkled faintly and reminiscently when the door was opened; swathed
hideous satin furniture, rose-wreathed Moquette carpets in faint
pinks and blues, looped brocaded curtains creased and cracked with
the years, tables topped with marble and mosaic, great mirrors rising
up to the high ceilings; everything that could rot, rotting, everything
that could bear dust covered with a deep plush of dust.
Sometimes, on a winter noon, chinks of bright light penetrated the
closed shutters and spun with motes. Sometimes an old chest or
chair gave forth a pistol shot of sound, and for a few hideous
seconds Gabrielle’s heart would stand still with utter terror. Once the
busy scratching of some small animal behind a wainscot brought her
heart into her mouth.
In one room—it had been the “cherry-and-silver parlour” a hundred
years ago—there was a cabinet of odds and ends: Dresden statues,
broken fans, collapsed ivory boxes and cloisonné. In other rooms
there were odd bits, some good, but almost all very bad: majolica,
onyx, ormolu, terra cotta. There were one or two good pictures, forty
bad ones: seascapes with boats, still-life studies of dead fish,
English nobility of the First Empire days, breakfasting in gardens,
peasants doing everything ever done by peasants, old woodcuts of
Queen Victoria and “Yes or No?”, “Dignity and Impudence,” and Mrs.
Siddons, curling and water-stained in their heavy frames.
The books that filled the handsome glass-doored shelves in the
dimly lighted, mouldy library, where light crept as into a cave, and
where the air was always damp and heavily scented with decay,
were almost all ruined after some especially wet winter. Their backs
were loosened, their badly printed pages clung together with black
stains: Lever and Scott, Shakespeare, The Iliad, Somebody’s History
of the World in Twenty Volumes, Somebody Else’s Classic Literature
in Forty. Sometimes Gabrielle selected one or two, and carried them
upstairs with her. She read voraciously anything and everything:
“Innocents Abroad,” “Forty-one Years in India,” “The Household Book
of English Verse,” Strickland’s “Mary of Scotland.”
But even with reading, wandering, tramping, exploring, music,
languages, the time passed slowly. Gabrielle became, and laughed
to find herself becoming, deeply interested in Aunt Flora’s evening
game of solitaire. Perhaps the two women never came quite so close
to each other as then, when Gay bent her bright head interestedly
above the cards, and Flora, with a card suspended, listened to
advice. Affectionate, and hungry for affection, Gabrielle was oddly
touched when she realized that Flora really liked her companionship
at this time, if at no other. Gay had been perhaps a week at
Wastewater when one evening, Flora, shuffling her packs, said
mildly:
“Don’t tire your eyes, Gabrielle, with that book!”
Gabrielle looked up, saw that the game was about to be
commenced. She had turned back to “Stratton” again, with a grateful
smile, when Flora said again:
“Was it last night when five aces came out in the first row?”
This was enough. The girl closed her book, leaned forward.
Presently she took a lighter chair, on the other side of the little card
table, and after that she always did.
On one of these evenings, when the wind was crying and they two
seemed alone, not only in the house, but in the world, Gay asked
suddenly:
“Aunt Flora, does anybody live in that north wing, opposite where I
am but on the same floor?”
“I don’t understand you. How could—how do you mean?” said Mrs.
Fleming. Gay saw that she had turned a deathly colour, and was
breathing badly, and she told herself remorsefully that such a query,
hurled unexpectedly into the silence, might well terrify any nervous
elderly woman, living alone.
Eager to simplify matters, she recounted her odd experience on the
very first night after her return. She had often looked over in that
direction since, she went on, but had seen nothing. But, weary and
confused that first night, she might never have gotten to sleep but for
the reassuring knowledge that David was so near!
“You may have seen a reflection of some light in the trunk room, up
above where you are,” Flora suggested. “Perhaps Maria or Hedda
went up there with John and your trunk.”
“No, for they didn’t take my trunk until next day! But they might have
gone up there to make room,” Gabrielle conceded, cheerfully,
distressed at the continued pallor of her aunt’s face.
“I’ll have Hedda and Maria go all over everything,” Flora said. “I’ll tell
them to lock everything and look over everything to-morrow.” And
with a mottled hand that shook badly, she resumed her manipulation
of the cards, and Gabrielle for a time thought no more about the
matter.
The two lonely women had a turkey on Thanksgiving Day, and Flora
a telegram from Sylvia. And not long after that it was time to prepare
for Sylvia’s homecoming at Christmas.
This, Gabrielle perceived, was to be an event quite unparalleled by
any of the sober festivities at Wastewater since Uncle Roger’s day.
Last Christmas Flora had gone to Sylvia, shut in the college infirmary
with a sharp touch of influenza, and last summer Sylvia had taken a
six weeks’ extension course, and had spent only odd weeks and
week-ends at Wastewater; she had not been enough at home to
alter in any way the quiet routine of the household.
But this was different. The Christmas holidays, beginning with a little
Christmas house party, would be almost like a housewarming—a
sort of forerunner of Sylvia’s attaining her majority and becoming the
real owner and the mistress of Wastewater. Sylvia would be twenty-
one in late June, when David and her mother would end their long
guardianship and surrender to her her inheritance from Black Roger
Fleming. Tom was legally, technically, dead; the family felt now that
he was truly dead, and every passing year had helped to entrench
Flora in her feeling of security. If she had ever expected his return,
she did so no longer. The courts had confirmed Sylvia’s
expectations. David and Flora had administered her affairs carefully
—Flora felt that to her Wastewater would always be home, and that
her beautiful child would be rich.
Gabrielle, speculating upon Sylvia’s prospects, had long ago
satisfied herself that whatever they were, David would share them. It
was the logical, the probable thing; Gabrielle had indeed taken it half
for granted, for years. Now, when she heard the quiet little note of
admiration in his voice when he spoke of Sylvia, when she studied
Sylvia’s pictures and found them beautiful, when she realized how
pledged he was to the service of Sylvia’s interests, anxious to do
everything that Sylvia would approve, she appreciated that forces as
strong as love bound them together, and she fancied—and not
without a little wistful pain—that love might easily—easily!—be there
too. Everything, everything for Sylvia.
The scale upon which the preparations for the Christmas house
party were commenced was astonishing to Gabrielle. She had not
supposed her aunt capable of even thinking in such terms. Aunt
Flora had always been the last person in the world to associate with
thoughts of lavish hospitality, generous and splendid entertaining.
But Aunt Flora went about this business of getting ready with a sure
and steady hand that astonished Gabrielle, who could remember
nothing of the old days of Wastewater’s splendour.
By mid-December some of the big downstairs rooms were opened,
and Margret, aged, gray, wrinkled like a rosy apple, and always with
a kindly word for Gabrielle, was directing the other servants in the
disposition of the furniture. Linen covers came off, mirrors were
rubbed, and fires crackled in the unused fireplaces. The chairs were
pushed to sociable angles, and whenever there was sunlight the
windows were opened wide to receive it.
Upstairs Flora counted out the beautiful heavy linen sheets, aired the
blankets, hung fringed towels upon the balcony railings to lose their
scent of camphor. From the dining-room mantel projected a new and
ugly but eminently satisfactory airtight stove, and the crackle of wood
within it and the delicious corresponding softness in the cool heavy
air of the room gave Gay one of the pleasantest sensations she had
had at Wastewater. In the big square pantry the maids washed and
piled china and glass; some of it Gabrielle had never seen before:
pink Doulton, green and pink Canton, fine Old Blue.
Downstairs in the kitchen region was pleasantest of all, for Trude had
a free hand at last, and she and Hedda often broke into their own
ecstatic tongue under the novelty and excitement of it, remembering
old days in Bruges, when they had made Christmas cakes and had
stuffed fat geese for the oven. Trude chopped mincemeat, made her
famous damp, dark, deliciously spiced dried-apple cake “by the
yard,” Gabrielle said, prepared great jars of sauces and mayonnaise
and stored them in the vault-like regions of the cellar, ready for the
onslaught of young appetites and unexpected meals between meals.
The grocer’s boy from Crowchester delivered whole crates of cereals
and vegetables, and from Boston came hams and bacon, raisins and
nuts, meats and oysters in boxes and kegs that dripped with ice.
Yet it was not to be so very large a party, after all. There would be
Laura and Gwen Montallen, the nice Canadian girls from Quebec;
Bart Montallen, their cousin from England; Arthur Tipping, “who will
be Lord Crancastle some day”; and Bart Montallen’s chum, a man
named Frank du Spain, from Harvard. All three of the men were in
college together, and the three girls had been classmates for years.
David would of course join them, making seven, and “Gay eight,”
wrote Sylvia, kindly, “and we may have an extra man for good
measure, if I find just the right one, so that we’ll be just ten, with you,
Mamma dear. And that’s just right. Now please don’t go to making
too elaborate preparations, these are all the simplest and least
exacting of people, as you’ll instantly see. They want to walk, talk,
have some music perhaps—ask Gay to be ready, for Mr. Tipping
sings—have good meals, and in five days it will all be over, and then
you and I can have some real talks and make up for lost time. Of
course, if we could dance, one of the nights, that would be
wonderful, in the old parlour where the Neapolitan boy is, for the
ballroom’s much too big for so few. But I confess the thought of the
music daunts me——”
The thought of it, however, did not daunt Flora. There was even a
triumphant little smile on her face when she came to this line. A four-
piece orchestra should of course come down from Boston; the
square piano was wheeled into the ballroom, and two days before
Sylvia’s expected arrival two men with mud and ice on their boots,
and mittens crusted with ice, and red, frost-bitten faces, came out
from Crowchester with a whole truckload of potted palms and
shining-leafed shrubs, all boxed and sacked, tagged and crated
carefully for their return trip to Boston when the festivities should be
over.
Gabrielle caught the joyous excitement of it, or perhaps created it to
a large extent, and in a shabby linen uniform and an old sweater of
David’s rushed about with dusters and buckets, nails and strings,
climbed ladders, rubbed silver, and flung herself into the
preparations generally with an enthusiasm that warmed even Aunt
Flora. Flora had loitered, coming out from church on the Sunday
previous, and had quite composedly asked a score of the nicest
young persons in Crowchester to the dance; invitations that, to
Gabrielle’s surprise, were pleasantly and informally worded and
invariably accepted by mothers and aunts with much appreciation.
One day, when they were filling a great jar with the spreading
branches that bore polished fine leaves of wild huckleberry, Flora
said suddenly:
“What frocks have you, Gabrielle?”
“Well, I have my uniforms, and my new suit that I wear to church,”
Gabrielle responded, readily, “and my velvet for afternoons, and my
brown lace, and my three blouses.”
Flora said nothing at the time; she struggled with the branches
silently, removed the rough gloves that had covered her hands, and
called Daisy to sweep up the pantry floor. But later in the day she
showed Gabrielle one of the wardrobes that held Sylvia’s clothes.
“It will be a small dance, of course,” she said, “and your lace dress is
just from Paris, after all. But it’s possible that you might wear one of
these—some of them Sylvia hasn’t had on this year.” And she drew
out a limp skirt or two, a pink satin, a white net with pink roses
flouncing it, a brocaded scarlet and gold.
“All the rose colours!” Gabrielle said, smiling.
“She’s dark,” the mother said, in a quiet voice that swelled in spite of
her. And she glanced at the picture of Sylvia on Sylvia’s bureau—a
stunning Sylvia in a big fur collar and a small fur hat.
It was for Gabrielle to scour the woods for beautiful shrubs and
winter colours, and she did it enthusiastically, well rewarded when
Flora smiled, in spite of herself, at the sight of berry-studded briars
and glossy pointed holly interspersed with scarlet beads. There were
no loneliness and no idleness for Gabrielle now; she was off, well
wrapped and in heavy overshoes, immediately after lunch,
sometimes laughing aloud when she found herself in the sunlighted
snowy sweetness of the woods, trampling the first light fall of virgin
snow, breathing the spicy, tingling air with great eager respirations,
and calling out a holiday greeting to other holly- and mistletoe-
hunting folk.
CHAPTER VI
On the day that Sylvia and her guests were coming from the north,
and David probably from the south, there was no sunshine. There
was a cold, unsteady, wind, and a cold, hard, low-hung mackerel sky,
under which the sea moved rough and restless, topped with racing
caps of white. All the world was gray and forlorn; distances were
shortened, the little houses in Crowchester and Keyport were closed
against the weather and showed no sign of life except the varying
plumes of smoke that rose from their frosted roofs. From them
occasionally emerged muffled and mittened figures, with tippets
blowing behind them or bellying giddily before; Gabrielle, who had
gone into town with John on some last errands, thought she had
never seen so many shabby hungry gulls, so many lean cats
investigating snow-topped garbage barrels, such dreary-looking
raiment hung snow-laden upon such sagging clotheslines.
“A heavy storm on the way,” John said. And Gabrielle, beside him on
the front seat of the little car, with a crate of eggs steadied at her feet
and two quarts of whipping cream held firmly in two bottles in her
lap, looked up at the scudding sky and thought with exhilaration that
it was probably true, and that all the company, and David, would be
here in a few hours, to make merry in Wastewater and defy it.
She picked and seeded raisins for an hour in the kitchen before
luncheon, and came to the meal with her cheeks red and her head
hot, and after luncheon went out into the woods, where a genuine
colour presently stung the warm brunette skin to glowing, and where
wrestling and tugging with obdurate saplings made her tingle from
head to foot and push her hat back from her damp forehead,
laughing and panting with the tussle. Aunt Flora had said, with one of
her rare touches of companionship, “I would just like that empty
corner of the hall filled up—some sort of branchy thing——” and
Gabrielle had been only too glad to make it her business to fill it. She

Download pdf Information Systems Architecture And Technology Proceedings Of 40Th Anniversary International Conference On Information Systems Architecture And Technology Isat 2019 Part Ii Jerzy Swiatek ebook full chapter

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Download pdf Information Systems Architecture And Technology Proceedings Of 40Th Anniversary International Conference On Information Systems Architecture And Technology Isat 2019 Part Ii Jerzy Swiatek ebook full chapter

Uploaded by

Copyright:

Available Formats

Information Systems Architecture and

Technology Proceedings of 40th

Information Systems Architecture and Technology

Information Systems Architecture and Technology

Information Systems Architecture and Technology

Information Technology and Systems Proceedings of ICITS

Business Information Systems: 22nd International

Proceedings of the International Conference on

Proceedings of Second International Conference on

Engineering, Information and Agricultural Technology in

** Indexing: The books of this series are submitted to ISI Proceedings,

More information about this series at http://www.springer.com/series/11156

ISSN 2194-5357 ISSN 2194-5365 (electronic)

ISAT is a forum for speciﬁc disciplinary research, as well as on

September 2019 Leszek Borzemski

ISAT 2019 Conference Organization

Local Organizing Committee

International Program Committee

Udo Buscher, Germany Marian Molasy, Poland

ISAT 2019 Reviewers

ISAT 2019 Keynote Speaker

Professor Cecilia Zanni-Merk, Normandie Université, INSA Rouen, LITIS,

Topic: On the Need of an Explainable Artiﬁcial Intelligence

Production Planning and Management System

Systems Analysis and Modeling

Knowledge Discovery and Data Mining

Artiﬁcial Intelligence Methods and Its Applocations

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341

Robert Wójcik1(&) , Grzegorz Bocewicz2 ,

Keywords: Cascade-like topology Repetitive processes Cycle time

© Springer Nature Switzerland AG 2020

r15 r27 r39

r16 r28 r3(10)

rij – operation time ci – cycle time

Fig. 1. An example of the extended cascade-like system.

1.1 System Description

oi=ri1 ri=ri2 rj=rj1 oj=rj2

rij – operation time ci – cycle time Pi – cyclic process

Fig. 2. A basic system of two processes (2-P) sharing one resource.

1.2 Content of the Sections

2 Model of the Extended Cascade-Like System

The cascade-like system behaviour (Fig. 1) depends on dynamics of subsystems

Pi – cyclic process rij – operation time ci – cycle time

Fig. 3. An extended system of two processes sharing a resource.

3.1 Start Times of Processes in the Basic 2-P System

tij ðlÞ ¼ aj ðlÞmod ci ¼ fij ðlÞDij þ yij ðlÞ & l ¼ 0; 1; 2; . . . ð1Þ

ri  tij ðlÞ  ci rj ð2Þ

3.2 System CS-E Parameters that Meet the No-Wait Constraints

2  ri2 þ rj1  Dij ; i:e: 2  ri2 þ rði þ 1Þ1  Diði þ 1Þ ð4Þ

Hence, the following theorem holds.

4 Synthesis of No-Wait Cyclic Schedule Parameters

Let us consider a CS-E system (Fig. 1) of processes ðP1 ; . . .; Pi ; Pi þ 1 ; . . .; Pn Þ with set

The problem of synthesis of parameters of repetitive process systems with cascade-like

You might also like

ri tij ðlÞ ci rj ð2Þ

2 ri2 þ rj1 Dij ; i:e: 2 ri2 þ rði þ 1Þ1 Diði þ 1Þ ð4Þ