All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 11 of 11

Showing per page

Managing a patient waiting list with time-dependent priority and adverse events

Daiki Min, Yuehwern Yih (2014)

RAIRO - Operations Research - Recherche Opérationnelle

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...

Maximization of distances of regular polygons on a circle

Filip Guldan (1980)

Aplikace matematiky

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).

Méthode heuristique pour le problème de flow shop hybride avec machines dédiées

Najoua Dridi, Hatem Hadda, Sonia Hajri-Gabouj (2009)

RAIRO - Operations Research

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...

Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine

Philippe Chrétienne (2001)

RAIRO - Operations Research - Recherche Opérationnelle

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 ( n log n ) algorithm for the special case of symmetric and task-independent costs. In this paper we first extend that algorithm to the case of asymmetric...

Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine

Philippe Chrétienne (2010)

RAIRO - Operations Research

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...

Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds

Cyril Briand, Samia Ourari (2013)

RAIRO - Operations Research - Recherche Opérationnelle

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.

Monotone interval eigenproblem in max–min algebra

Martin Gavalec, Ján Plavka (2010)

Kybernetika

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.

MOPP-I: an optimization package for multipurpose batch operations.

M. Lázaro, Antonio Espuña Camarasa, Lluís Puigjaner Corbella (1989)

Qüestiió

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 – 11 of 11

Page 1