Wyniki wyszukiwania dla: TIME-SCHEDULE CONTROL - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: TIME-SCHEDULE CONTROL

Wyniki wyszukiwania dla: TIME-SCHEDULE CONTROL

  • Scheduling jobs to contain a natural disaster: a model and complexity

    this paper is devoted to the problem of scheduling suppression units so that a natural disaster is dealt with as efficient as possible. the concept of deteriorating jobs is adopted, that is, the formal model of scheduling represents linearly increasing value loss as the disaster remains unsuppressed and increasing time for its suppression. more precisely, two different goals are considered: finding a suppression schedule of minimal...

  • Stanowisko do diagnostyki i regulacji wyzwalaczy przekaźników w obwodach lokomotyw elektrycznych

    Publikacja

    Fast circuit breaker and protective relays play an important role of protecting locomotive’s electrical circuits from damage caused by short circuit or overload. Undisturbed operation and proper circuit protection depends on the technical condition and fine calibration of the over-current trips. Therefore the relays should be subject to periodic inspection and adjustment due to locomotive maintenance schedule. A test stand for...

  • Influence of passive house technology on time and cost of construction investment

    Publikacja

    - Rok 2018

    Due to the changes in the energy standards for housing in Poland there are many concerns. Is the standard required by the regulation achievable and if it is, then at what cost? There are many solutions to construct a building in line with the requirements of passive house technology. They are differentiated by price and time required for implementation. This study is based on the solution proposed by one of Polish companies, offering...

    Pełny tekst do pobrania w portalu

  • Restricted open shop scheduling

    In the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule)....

    Pełny tekst do pobrania w serwisie zewnętrznym

  • [Soft Skills] Writing grant application

    Kursy Online
    • R. Downar-Zapolska
    • A. Klej

    Writing grant application, 5 h., Teacher: Renata Downar-Zapolska, GUT Schedule: 20 & 21 April 2022, time: 15:45-18:00

  • Nowa metoda diagnostyki stanu technicznego nakładek stykowych

    The current collection system, which consists of the overhead contact line and a current collector, is particularly important in electric rail vehicles, where their reliability is concerned. Faultless current collection is conditioned not only by suitable construction of these elements but also by their proper maintenance. Retaining permanent electrical contact is essential in DC systems, where current demand is relatively high. In...

  • Phong B. Dao D.Sc., Ph.D.

    Osoby

    Phong B. Dao received the Engineer degree in Cybernetics in 2001, the M.Sc. degree in Instrumentation and Control in 2004, both from Hanoi University of Science and Technology in Vietnam, and the Ph.D. degree in Control Engineering in 2011 from the University of Twente, the Netherlands. In May 2020, Dr. Dao received the degree of D.Sc. (Habilitation) in Mechanical Engineering from the AGH University of Science and Technology, Poland....

  • Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines

    Publikacja

    - DISCRETE APPLIED MATHEMATICS - Rok 2018

    We consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.

    Pełny tekst do pobrania w portalu

  • Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments

    We consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard,...

    Pełny tekst do pobrania w portalu

  • Robotic manipulators, Lab, MiBM, st. I, sem.6 (PG_00053663) 03.2022 Fri

    Kursy Online
    • W. Sieklicki

    The course Manipulators and Industrial Robots (laboratory) is for students of the 6th semester of a full-time bachelor's degree studies of Mechatronics. The course includes  laboratory classes in the field of industrial manipulators - their construction, features, components, control, and modular robots - their programming and models.

  • Robotic manipulators, Lab, MiBM, st. I, sem.6 (PG_00053663) 03.2023

    Kursy Online
    • W. Sieklicki

    The course Manipulators and Industrial Robots (laboratory) is for students of the 6th semester of a full-time bachelor's degree studies of Mechatronics. The course includes  laboratory classes in the field of industrial manipulators - their construction, features, components, control, and modular robots - their programming and models.

  • Robotic manipulators, Lab, MiBM, st. I, sem.6 (PG_00053663) 03.2024 kopia 1

    Kursy Online
    • W. Sieklicki

    The course Manipulators and Industrial Robots (laboratory) is for students of the 6th semester of a full-time bachelor's degree studies of Mechatronics. The course includes  laboratory classes in the field of industrial manipulators - their construction, features, components, control, and modular robots - their programming and models.

  • Robotic manipulators, Lab, MiBM, st. I, sem.6 (PG_00053663) 03.2024

    Kursy Online
    • W. Sieklicki

    The course Manipulators and Industrial Robots (laboratory) is for students of the 6th semester of a full-time bachelor's degree studies of Mechatronics. The course includes  laboratory classes in the field of industrial manipulators - their construction, features, components, control, and modular robots - their programming and models.

  • Robotics, Lab, MiBM, st. II, sem.1 (PG_00057380) 03.2022 Thu

    Kursy Online
    • W. Sieklicki

    The course Robotics (laboratory) is for students of the 1st semester of a full-time Master degree studies of Machine Design. The course includes  laboratory classes in the field of industrial manipulators - their construction, features, components, control, and modular robots - their programming and models.

  • Stanisław Galla dr inż.

    Urodził się w 1970 w Gdańsku. Jest absolwentem Technikum Mechaniczno Elektrycznego w Gdańsku (1990). Studiował na Wydziale Elektrotechniki Politechniki Gdańskiej (studia ukończył w 1996). Rozprawę doktorską pt. „Metodyka zwiększania dokładności pomiarów małoczęstotliwościowych wskaźników zaburzeń okresowych występujących w sieciach niskiego napięcia” obronił w 2009 r na Wydziale Elektrotechniki i Automatyki Politechniki Gdańskiej....

  • The project of pull system for storehouse and production line in a company provides electronics

    Publikacja

    - Rok 2012

    The chapter below presents how to reduced delivery of the material to production by using a "Kanban schedule board" and related tools from 48 hours and 59 minutes to 41 minutes in a company provides electronics. The solution was found through analysis of the current way of supplying stands and using Just In Time idea, the reduction of ''muda''. To solve the problem was used Kanban card", which has the shape of two triangles joined...

  • Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines

    The problem of scheduling n identical jobs on 4 uniform machines with speeds s1>=s2>=s3>=s4 is considered.The aim is to find a schedule with minimum possible length. We assume that jobs are subject to mutual exclusion constraints modeled by a bipartite incompatibility graph of degree delta. We show that the general problem is NP-hard even if s1=s2=s3. If, however, delta<5 and s1>12s2 s2=s3=s4, then the problem can be solved to...

    Pełny tekst do pobrania w portalu

  • Computer Controlled Systems Lab - 2023/2024

    Kursy Online
    • P. Raczyński

    Computer Controlled Systems Lab The course includes 5 individual projects and their laboratory implementation. The topics:- Job analysis and tuning digital servo- Usage of a PC computer and MatLab package for controlling the dynamic object as a model of the tethered helicopter- Use of C language and the PC to control the plant in real time- Use of assembly language, and a microcontroller to control the plant in real time- Use...

  • Computer Controlled Systems Lab - Nowy - Nowy

    Kursy Online
    • P. Raczyński
    • M. Niedźwiecki

    Computer Controlled Systems Lab The course includes 5 individual projects and their laboratory implementation. The topics:- Job analysis and tuning digital servo- Usage of a PC computer and MatLab package for controlling the dynamic object as a model of the tethered helicopter- Use of C language and the PC to control the plant in real time- Use of assembly language, and a microcontroller to control the plant in real time- Use...

  • Andrzej Chybicki dr inż.

    Z wykształcenia informatyk, absolwent Wydziału Elektroniki, Telekomunikacji i Informatyki Politechniki Gdańskiej, doktor nauk technicznych w dziedzinie informatyka specjalizujący się w przetwarzaniau danych przestrzennych w rozproszonych systemach informatycznych. Ukierunkowany na wykorzystywanie osiągnięć i wiedzy zakresu prowadzonych badań w przemyśle. Współpracował z szeregiem podmiotów przemysłu informatycznego, geodezyjnego...