The objective of the study was to evaluate scheduling delay of dental exams in the city of São Paulo of patients suspected of having oral cancer. A cross-sectional study was performed in which telephone conversations simulated clinical situations that represented two types of patients: one presenting symptoms suggestive of oral cancer (CA), and another one suggesting the need for prostheses (PR...

Managing transactions with real-time requirements and disk resident data presents many new problems. In this paper we address several: How can we schedule transactions with deadlines? How do the real-time constraints affect concurrency control? How does the scheduling of IO requests affect the timeliness of transactions? How should exclusive and shared locking be handled? We describe a new grou...

During the past several years, a large number of studies have been conducted in the area of sharable resource constrained scheduling problems. Intelligent manufacturing planning and scheduling based on meta-heuristic methods, such as the simulated annealing and particle swarm optimization, have become common tools for finding satisfactory solutions within reasonable computational times in real ...

This paper considers the two-agent scheduling problems with deteriorating jobs and group technology on a single machine, where the objective is to minimize the total completion time of the first agent with the restriction that the maximum cost of the second agent cannot exceed a given upper bound. Two agents compete to perform their respective jobs on a common single machine, and each agent has...

in this paper, a new approach to overlapping operations in job shop scheduling is presented. in many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. in each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...

We consider the stability of robust scheduling policies for Lu-Kumar networks. These are open networks with arbitrary routing matrix and several disjoint groups of queues in which at most one queue can be served at a time in each group. The arrival and potential service processes and routing decisions at the queues are independent, stationary and ergodic. A scheduling policy is called robust if...

Background and Objectives: Operating room (OR) scheduling is key to optimal operating room productivity. The significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. This paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. The model considers various surgical operation co...

The K-coverage configuration that guarantees coverage of each location by at least K sensors is highly popular and is extensively used to monitor diversified applications in wireless sensor networks. Long network lifetime and high detection quality are the essentials of such K-covered sleep-scheduling algorithms. However, the existing sleep-scheduling algorithms either cause high cost or cannot...

The scheduling process, usually involve the evaluation and selection of one alternative between a set of them. These decisions are not trivial, considering that they usually involve multiple, and sometimes conflicting, criteria. Particularly in scheduling which aim is to find the trade off between loading efficiency and delivery accuracy taking into account holding costs, tardiness penalties an...

With the rapid development of civil aviation transportation, an increasing number airport groups are formed. However, existing literature on fairness mostly focuses among airlines. There is no research realization scheduling airports with overlapping resources in group. The goal this paper to comprehensively consider efficiency and slot scheduling, where should include both interairline interai...