Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Richard N. Burns"'
Autor:
Charles M. Richart, Donald E. Barker, David L. Ciraulo, Richard N. Burns, Henry Kaufman, Lisa Smith
Publikováno v:
The Journal of Trauma: Injury, Infection, and Critical Care. 48:201-207
Background: Temporary abdominal wound closure after celiotomy for trauma is often desirable. The ideal method of temporary closure should allow rapid closure, easy maintenance, and allow reexploration and wound repair with minimal tissue damage. Over
Publikováno v:
Naval Research Logistics. 45:839-853
This paper presents an efficient algorithm for scheduling a single-category work force on 4-day or 3-day work weeks. Employees work 4 or 3 days each week, have A out of every B weekends off, and work no more than 5 consecutive days in a work stretch
Autor:
Hamilton Emmons, Richard N. Burns
Publikováno v:
Operations Research. 39:484-495
A work force includes workers of m types. The worker categories are ordered, with type-1 workers the most highly qualified, type-2 the next, and so on. If the need arises, a type-k worker is able to substitute for a worker of any type j > k (k = 1,
Autor:
G. J. Koop, Richard N. Burns
Publikováno v:
Operations Research. 35:100-110
This paper introduces a practical approach to multiple-shift manpower scheduling by presenting an algorithm that applies the approach to a large and common class of problems. The algorithm constructs schedules that utilize no more than the minimum nu
Autor:
Richard N. Burns, Michael W. Carter
Publikováno v:
Management Science. 31:599-607
In recent years, labour negotiations for seven-day-week organizations such as hospitals, mining companies and chemical industries have seen an increased emphasis on improving shift schedules. This paper gives an exact lower bound on the number of wor
Autor:
Richard N. Burns
Publikováno v:
Naval Research Logistics Quarterly. 23:125-129
A result of Smith previously published in this journal [3], on the use of secondary criteria in scheduling problems, is shown to be incorrect and a counter example is presented. Heck and Roberts [2] suggested that their paper would be extended in the
Publikováno v:
A I I E Transactions. 11:286-292
A day-off scheduling problem is analyzed, in which the objective is to minimize the total workforce size necessary to meet a given daily requirement for staff and subject to constraints involving frequency of weekends off and length of work tours. By
Autor:
Richard N. Burns
Publikováno v:
INFOR: Information Systems and Operational Research. 16:101-111
The effects of labour policies on the size of the work force are studied for a seven day a week operation. A formula is given for calculating the minimum number of people that need to be employed f...