The search session has expired. Please query the service again.
This paper addresses the problem of managing a waiting list for elective surgery to decide the number of patients selected from the waiting list and to schedule them in accordance with the operating room capacity in the next period. The waiting list prioritizes patients not only by their initial urgency level but also by their waiting time. Selecting elective surgery patients requires a balance between the waiting time for urgent patients and that for less urgent patients. The problem is formulated...
This paper presents the solution of a basic problem defined by J. Černý which solves a concrete everyday problem in railway and road transport (the problem of optimization of time-tables by some criteria).
Dans ce papier, nous traitons le problème de minimisation du
makespan dans un flow shop hybride à deux étages avec machines
dédiées. En premier lieu, nous présentons des propriétés de base, un
ensemble de bornes inférieures et deux cas polynomiaux. En second
lieu, nous proposons une nouvelle heuristique qui exploite ces
propriétés, et cherche à placer les jobs, en tenant compte pour
chaque instance du problème, de la valeur de la borne inférieure.
La dernière partie de ce travail présente les résultats
expérimentaux...
We are considering a two-stage optimal scheduling problem, which involves two similar projects with the same starting times for workers and the same deadlines for tasks. It is required that the starting times for workers and deadlines for tasks should be optimal for the first-stage project and, under this condition, also for the second-stage project. Optimality is measured with respect to the maximal lateness (or maximal delay) of tasks, which has to be minimized. We represent this problem as a...
Assume that tasks must be processed by one machine in a fixed sequence. The processing time, the preferred starting time and the earliness and tardiness costs per time unit are known for each task. The problem is to allocate each task a starting time such that the total cost incurred by the early and tardy tasks is minimum. Garey et al. have proposed a nice algorithm for the special case of symmetric and task-independent costs. In this paper we first extend that algorithm to the case of asymmetric...
Assume that n tasks must be processed by one machine in a fixed
sequence. The processing time, the preferred starting time and
the earliness and tardiness costs per time unit are known for each
task. The problem is to allocate each task a starting time such
that the total cost incurred by the early and tardy tasks is
minimum. Garey et al. have proposed a nice O(nlogn)
algorithm for the special case of symmetric and task-independent
costs. In this paper we first extend that algorithm to the...
This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. The objective is to find a feasible job sequence that minimizes the number of tardy jobs. On the basis of an original mathematical integer programming formulation, this paper shows how good-quality lower and upper bounds can be computed. Numerical experiments are provided for assessing the proposed approach.
The interval eigenproblem in max-min algebra is studied. A classification of interval eigenvectors is introduced and six types of interval eigenvectors are described. Characterization of all six types is given for the case of strictly increasing eigenvectors and Hasse diagram of relations between the types is presented.
A number of algorithms have been developed -including enumeration of feasible production sequences, alternative task selection and the generation of alternative production lines- to determine the optimal sequence in which products and by-products should be produced and the times at which the various production operations for each product should be carried out to meet a given product demand pattern, taking into account the available equipment, storage costs, stopover penalties and other plant limitations.Product...
Currently displaying 1 –
12 of
12