Results 21 to 30 of about 763,342 (316)

Scheduling problems [PDF]

open access: yesJournal of Combinatorial Theory, Series A, 2016
We introduce the notion of a scheduling problem which is a boolean function $S$ over atomic formulas of the form $x_i \leq x_j$. Considering the $x_i$ as jobs to be performed, an integer assignment satisfying $S$ schedules the jobs subject to the constraints of the atomic formulas. The scheduling counting function counts the number of solutions to $S$.
Caroline J. Klivans, Felix Breuer
openaire   +2 more sources

Sustainable green construction management: schedule performance and improvement

open access: yesTechnological and Economic Development of Economy, 2014
Over the last few years, the green building movement in Singapore has leaped bountifully. While environmental sustainability for greener construction has been emphasized, rare research has been conducted to analyze performance of green construction ...
Bon-Gang Hwang   +2 more
doaj   +1 more source

Mapping, Scheduling, and Schedulability Analysis

open access: yes, 2022
This chapter presents how the P-SOCRATES framework addresses the issue of scheduling multiple real-time tasks (RT tasks), made of multiple and concurrent non-preemptable task parts. In its most generic form, the scheduling problem in the architectural framework is a dual problem: scheduling task-to-threads, and scheduling thread-to-core replication.
Burgio P.   +4 more
openaire   +2 more sources

Umbral Anaeróbico. Problemas conceptuales y aplicaciones prácticas en deportes de resistencia (Anaerobic Threshold. Conceptual problems and practical applications in endurance sports)

open access: yesRetos: Nuevas Tendencias en Educación Física, Deportes y Recreación, 2019
El objeto de este artículo fue mostrar el excesivo entramado terminológico relacionado con el entrenamiento del umbral anaeróbico (UAN). Faude, Kindermann y Meyer (2009) encontraron 25 acepciones diferentes sobre el termino umbral.
Emilio Fernandez Rodriguez   +3 more
doaj   +1 more source

TIME RESERVES DURING THE ORGANISATION OF FREIGHT TRAIN MOVEMENT ON SCHEDULE

open access: yesNauka ta progres transportu, 2015
Purpose. The article is devoted to the development of estimation methods of time reserves that should be formed at the train schedule and the schedule for the turnover of freight trains, required to ensure the sustained interaction of technological ...
D. M. Kozachenko   +3 more
doaj   +1 more source

Online scheduling and project scheduling [PDF]

open access: yes, 2009
This thesis presents new and improved scheduling algorithms for a number of scheduling problems. The first part of the thesis deals with two online-list scheduling problems, both with the objective to minimize the makespan. In these problems, the jobs arrive one by one and the decision maker has to irrevocably schedule the arriving job before the next ...
openaire   +2 more sources

ON DECOMPOSITION OF PROBLEM OF CONSTRUCTING THE AGREED TIMETABLE IN PROJECT ACTIVITIES

open access: yesСтатистика и экономика, 2016
Most productions scheduling problems in the planning of operations or worksdo not consider the factor of activity associated with the project activities ofindividual agents. Based on the elements of an open (agreed) managementand to promote the theory of
Alexey S. Dobrynin   +2 more
doaj   +1 more source

How to schedule night shift work in order to reduce health and safety risks

open access: yesScandinavian Journal of Work, Environment & Health, 2020
OBJECTIVES: This discussion paper aims to provide scientifically based recommendations on night shift schedules, including consecutive shifts, shift intervals and duration of shifts, which may reduce health and safety risks.
Anne Helene Garde   +14 more
doaj   +1 more source

List schedules for cyclic scheduling

open access: yesDiscrete Applied Mathematics, 1999
This paper adresses the definition and properties of list scheduling in the context of scheduling a cyclic set of n non-preemptive and non-reentrant-dependent tasks on m identical processors when the reduced precedence graph is assumed to be strongly connected.
openaire   +2 more sources

Nonclairvoyant scheduling

open access: yesTheoretical Computer Science, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Steven J. Phillips   +2 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy