Improving local search heuristics for some scheduling problems - I

Local search techniques like simulated annealing and tabu search are based on a neighborhood structure defined on a set of feasible solutions of a discrete optimization problem. For the scheduling problems $P2||C_{max}, 1|prec|\sum C_i$ and $1||\sum T_i$ we replace a simple neighborhood by a neighborhood on the set of all locally optimal solutions. This allows local search on the set of solutions that are locally optimal

Job-shop scheduling with limited capacity buffers

In this paper we investigate job-shop problems where limited capacity buffers to store jobs in non-processing periods are present. In such a problem setting, after finishing processing on a machine, a job either directly has to be processed on the following machine or it has to be stored in a prespecified buffer. If the buffer is completely occupied the job may wait on its current machine but blocks this machine for other jobs. Besides a general buffer model, also specific configurations are considered. The aim of this paper is to find a compact representation of solutions for the job-shop problem with buffers. In contrast to the classical job-shop problem, where a solution may be given by the sequences of the jobs on the machines, now also the buffers have to be incorporated in the solution representation. In a first part, two such representations are proposed, one which is achieved by adapting the alternative graph model and a second which is based on the disjunctive graph model. In a second part, it is investigated whether the given solution representation can be simplified for specific buffer configurations. For the general buffer configuration it is shown that an incorporation of the buffers in the solution representation is necessary, whereas for specific buffer configurations possible simplifications are presented

Network flow models for intraday personnel scheduling problems

Personnel scheduling problems can be decomposed into two stages. In the first stage for each employee the working days have to be fixed. In the second stage for each day of the planning period an intraday scheduling problem has to be solved. It consists of the assignment of shifts to the employees who have to work on the day and for each working period of an employee a task assignment such that the demand of all tasks for personnel is covered. In Robinson et al. (Burke and Trick (Eds.), Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling, 18th August–20th August 2004, Pittsburgh, PA, USA, pp. 561–566, 2005), the intraday problem has been formulated as a maximum flow problem. The assumptions are that, employees are qualified for all tasks, their shifts are given, and they are allowed to change tasks during the day. In this work, we extend the network flow model to cover the case where not all employees are qualified to perform all tasks. The model is further extended to be able to calculate shifts of employees for the given day, assuming that an earliest starting time, a latest finishing time, and a minimal working time are given. Labour cost can be also taken into account by solving a minimum cost network flow problem

The Complexity of Mean Flow Time Scheduling Problems with Release Times

We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that when all jobs have equal processing times then the problem can be solved in polynomial time using linear programming. Our algorithm can also be applied to the open-shop problem with release times and unit processing times. For the general case (when processing times are arbitrary), we show that the problem is unary NP-hard.Comment: Subsumes and replaces cs.DS/0412094 and "Complexity of mean flow time scheduling problems with release dates" by P.B, S.

Image and information management system

A system and methods through which pictorial views of an object's configuration, arranged in a hierarchical fashion, are navigated by a person to establish a visual context within the configuration. The visual context is automatically translated by the system into a set of search parameters driving retrieval of structured data and content (images, documents, multimedia, etc.) associated with the specific context. The system places hot spots, or actionable regions, on various portions of the pictorials representing the object. When a user interacts with an actionable region, a more detailed pictorial from the hierarchy is presented representing that portion of the object, along with real-time feedback in the form of a popup pane containing information about that region, and counts-by-type reflecting the number of items that are available within the system associated with the specific context and search filters established at that point in time

Image and information management system

A system and methods through which pictorial views of an object's configuration, arranged in a hierarchical fashion, are navigated by a person to establish a visual context within the configuration. The visual context is automatically translated by the system into a set of search parameters driving retrieval of structured data and content (images, documents, multimedia, etc.) associated with the specific context. The system places ''hot spots'', or actionable regions, on various portions of the pictorials representing the object. When a user interacts with an actionable region, a more detailed pictorial from the hierarchy is presented representing that portion of the object, along with real-time feedback in the form of a popup pane containing information about that region, and counts-by-type reflecting the number of items that are available within the system associated with the specific context and search filters established at that point in time

Crystal Structure of a Nonsymbiotic Plant Hemoglobin

Background: Nonsymbiotic hemoglobins (nsHbs) form a new class of plant proteins that is distinct genetically and structurally from leghemoglobins. They are found ubiquitously in plants and are expressed in low concentrations in a variety of tissues including roots and leaves. Their function involves a biochemical response to growth under limited O2 conditions. Results: The first X-ray crystal structure of a member of this class of proteins, riceHb1, has been determined to 2.4 Å resolution using a combination of phasing techniques. The active site of ferric riceHb1 differs significantly from those of traditional hemoglobins and myoglobins. The proximal and distal histidine sidechains coordinate directly to the heme iron, forming a hemichrome with spectral properties similar to those of cytochrome b5. The crystal structure also shows that riceHb1 is a dimer with a novel interface formed by close contacts between the G helix and the region between the B and C helices of the partner subunit. Conclusions: The bis-histidyl heme coordination found in riceHb1 is unusual for a protein that binds O2 reversibly. However, the distal His73 is rapidly displaced by ferrous ligands, and the overall O2 affinity is ultra-high (KD ≈ 1 nM). Our crystallographic model suggests that ligand binding occurs by an upward and outward movement of the E helix, concomitant dissociation of the distal histidine, possible repacking of the CD corner and folding of the D helix. Although the functional relevance of quaternary structure in nsHbs is unclear, the role of two conserved residues in stabilizing the dimer interface has been identified

Clinical aspects of Mayer-Rokitansky-Kuester-Hauser syndrome: recommendations for clinical diagnosis and staging

BACKGROUND: The Mayer-Rokitansky-Kuester-Hauser (MRKH) syndrome is a malformation of the female genitals (occurring in one in 4000 female live births) as a result of interrupted embryonic development of the Müllerian (paramesonephric) ducts. This retrospective study examined the issue of associated malformations, subtyping, and the frequency distribution of subtypes in MRKH syndrome. METHODS: Fifty-three MRKH patients were investigated using a newly developed standardized questionnaire. Together with the results of clinical and diagnostic examinations, the patients were classified into the three recognized subtypes [typical, atypical and MURCS (Müllerian duct aplasia, renal aplasia, and cervicothoracic somite dysplasia)]. RESULTS: The typical form was diagnosed in 25 patients (47%), the atypical form in 11 patients (21%), and the most marked form—the MURCS type—in 17 patients (32%). Associated malformations were notably frequent among the patients. Malformations of the renal system were the most frequent type of accompanying malformation, with 23 different malformations in 19 patients, followed by 18 different skeletal changes in 15 patients. CONCLUSIONS: In accordance with the literature, this study shows that associated malformations are present in more than a third of cases. Therefore, new basic guidelines for standard diagnostic classification involving patients with suspected MRKH are presente

Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines

In this paper we characterize optimal schedules for scheduling problems with parallel machines and unit processing times by providing necessary and sufficient conditions of optimality. We show that the optimality conditions for parallel machine scheduling are equivalent to detecting negative cycles in a specially defined graph. For a range of the objective functions, we give an insight into the underlying structure of the graph and specify the simplest types of cycles involved in the optimality conditions. Using our results we demonstrate that the optimality check can be performed by faster algorithms in comparison with existing approaches based on sufficient conditions