Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Bryan A. Norman is active.

Publication


Featured researches published by Bryan A. Norman.


International Journal of Production Research | 2002

WORKER ASSIGNMENT IN CELLULAR MANUFACTURING CONSIDERING TECHNICAL AND HUMAN SKILLS

Bryan A. Norman; Wipawee Tharmmaphornphilas; Kim LaScola Needy; Bopaya Bidanda; Rona Colosimo Warner

This paper considers the problem of assigning workers to manufacturing cells in order to maximize the effectiveness of the organization. Organization effectiveness is assumed to be a function of the productivity, output quality, and training costs associated with a particular worker assignment. Traditionally, these worker assignments have been based only on the technical skills of the workers. The proposed model also includes human skills and permits the ability to change the skill levels of workers by providing them with additional training. The problem is formulated as a mixed integer programming problem. A total of 32 test problems were developed and varied with regard to the total training time, the available training time for each worker, the training costs, the productivity coefficients and the quality level coefficients. Results indicate that this model provides better worker assignments than one that only considers technical skills.


Naval Research Logistics | 1999

A GENETIC ALGORITHM METHODOLOGY FOR COMPLEX SCHEDULING PROBLEMS

Bryan A. Norman; James C. Bean

This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration type mutation. Convergence of the algorithm is proved. We present computational results on data sets from the auto industry. To demonstrate robustness of the approach, problems from the literature of different structure are solved by essentially the same algorithm.


Computers & Industrial Engineering | 2005

Human related issues in manufacturing cell design, implementation, and operation: a review and survey

Bopaya Bidanda; Poonsiri Ariyawongrat; Kim LaScola Needy; Bryan A. Norman; Wipawee Tharmmaphornphilas

The application of cellular manufacturing in batch-type environments is a well-known manufacturing strategy that typically improves manufacturing efficiency by utilizing the philosophy of group technology. It is also important that for the successful implementation of cellular manufacturing, that one focuses both on technical issues (cell formation and design) and human issues. Unfortunately, human issues are typically not examined as rigorously as often as technical issues. This paper presents an overview and evaluation of the diverse range of human issues involved in cellular manufacturing based on an extensive literature review. Further, a survey to determine the importance of eight different human issues in cellular manufacturing was administered to a sample of academics, managers, and workers involved in cellular design and implementation results are presented and discussed.


Ergonomics | 2000

Designing safe job rotation schedules using optimization and heuristic search

Brian J. Carnahan; Mark S. Redfern; Bryan A. Norman

Job rotation is one method that is sometimes used to reduce exposure to strenuous materials handling; however, developing effective rotation schedules can be complex in even moderate sized facilities. The purpose of this research is to develop methods of incorporating safety criteria into scheduling algorithms to produce job rotation schedules that reduce the potential for injury. Integer programming and a genetic algorithm were used to construct job rotation schedules. Schedules were comprised of lifting tasks whose potential for causing injury was assessed with the Job Severity Index. Each method was used to design four job rotation schedules that met specified safety criteria in a working environment where the object weight, horizontal distance and repetition rate varied over time. Each rotation was assigned to a specific gender/lifting capacity group. Five versions of the integer programming search method were applied to this problem. Each version generated one job rotation schedule. The genetic algorithm model was able to create a population of 437 feasible solutions to the rotation problem. Utilizing cluster analysis, a rule set was derived from the genetic algorithm generated solutions. These rules provided guidelines for designing safe job rotation schedules without the use of a computer. The advantages and limitations of these approaches in developing administrative controls for the prevention of back injury are discussed.


Iie Transactions | 2002

Optimization of indoor wireless communication network layouts

Martin D. Adickes; Richard E. Billo; Bryan A. Norman; Sujata Banerjee; Bartholomew O. Nnaji; Jayant Rajgopal

Radio Frequency Data Communications (RFDC)technology is rapidly becoming a critical component of many traditional industrial engineering functions including materials tracking, inventory control, warehousing, order processing, shipping and database management. As a means of moving information, RFDC has many attractive features, such as speed, accuracy, reliability, convenience and low operating costs. When implementing RFDC systems a major problem is to quickly and efficiently determine the locations where transceivers should be placed so that effective radio communication can take place. The research described in this paper addresses this issue by developing a computerized layout simulation system that incorporates heuristic optimization methods to solve the placement problem. The effectiveness of this unique automated layout methodology is demonstrated by comparing it with the current method of utilizing manual site surveys, as well as with other placement methods. The methodology and solutions are validated by field-testing at actual facilities.


Operations Research Letters | 2006

A new mixed integer programming formulation for facility layout design using flexible bays

Abdullah Konak; Sadan Kulturel-Konak; Bryan A. Norman; Alice E. Smith

This paper presents a mixed-integer programming formulation to find optimal solutions for the block layout problem with unequal departmental areas arranged in flexible bays. The nonlinear department area constraints are modeled in a continuous plane without using any surrogate constraints. The formulation is extensively tested on problems from the literature.


European Journal of Operational Research | 2006

Multi-objective tabu search using a multinomial probability mass function

Sadan Kulturel-Konak; Alice E. Smith; Bryan A. Norman

A tabu search approach to solve multi-objective combinatorial optimization problems is developed in this paper. This procedure selects an objective to become active for a given iteration with a multinomial probability mass function. The selection step eliminates two major problems of simple multi-objective methods, a priori weighting and scaling of objectives. Comparison of results on an NP-hard combinatorial problem with a previously published multi-objective tabu search approach and with a deterministic version of this approach shows that the multinomial approach is effective, tractable and flexible.


Vaccine | 2010

Single versus multi-dose vaccine vials: an economic computational model.

Bruce Y. Lee; Bryan A. Norman; Tina Marie Assi; Sheng I. Chen; Rachel R. Bailey; Jayant Rajgopal; Shawn T. Brown; Ann E. Wiringa; Donald S. Burke

Single-dose vaccine formats can prevent clinic-level vaccine wastage but may incur higher production, medical waste disposal, and storage costs than multi-dose formats. To help guide vaccine developers, manufacturers, distributors, and purchasers, we developed a computational model to predict the potential economic impact of various single-dose versus multi-dose measles (MEA), hemophilus influenzae type B (Hib), Bacille Calmette-Guérin (BCG), yellow fever (YF), and pentavalent (DTP-HepB-Hib) vaccine formats. Lower patient demand favors fewer dose formats. The mean daily patient arrival thresholds for each vaccine format are as follows: for the MEA vaccine, 2 patients/day (below which the single-dose vial and above which the 10-dose vial are least costly); BCG vaccine, 6 patients/day (below, 10-dose vial; above, 20-dose vial); Hib vaccine, 5 patients/day (below, single-dose vial; above, 10-dose vial); YF vaccine, 33 patients/day (below, 5-dose vials; above 50-dose vial); and DTP-HepB-Hib vaccine, 5 patients/day (below, single-dose vial; above, 10-dose vial).


American Journal of Public Health | 2005

Exemptions to School Immunization Requirements: The Role of School-Level Requirements, Policies, and Procedures

Daniel A. Salmon; Saad B. Omer; Lawrence H. Moulton; Shannon Stokley; M. Patricia deHart; Susan M. Lett; Bryan A. Norman; Stephen P. Teret; Neal A. Halsey

OBJECTIVES Our goal was to determine whether school-level variability in implementation of immunization requirements is associated with the likelihood of a child having received an exemption to school immunization requirements. METHODS We surveyed 1000 school immunization personnel in Colorado, Massachusetts, Missouri, and Washington. We explored associations between school implementation of immunization requirements and the likelihood of a child having an exemption using logistic regression models. RESULTS School policies associated with an increased likelihood of children having exemptions included lack of provision of written instructions for completing the school immunization requirement before enrollment, administrative procedures making it easier to claim an exemption, and granting of philosophical exemptions. In the 2 states we surveyed where philosophical exemptions are not authorized (Massachusetts and Missouri), 17.0% and 18.1% of schools reported permitting philosophical exemptions. CONCLUSIONS Inconsistencies in the interpretation and implementation of school immunization laws contribute to variability in rates of exemptions. School policies should be reviewed to ensure consistency with the intent of state laws.


Iie Transactions | 2001

Incorporating Physical Demand Criteria into Assembly Line Balancing

Brian J. Carnahan; Bryan A. Norman; Mark S. Redfern

Many assembly line balancing algorithms consider only task precedence and duration when minimizing cycle time. However, disregarding the physical demands of these tasks may contribute to the development of work-related musculoskeletal disorders in the assembly line workers. Three line balancing heuristics that incorporate physical demand criteria were developed to solve the problem of finding assembly line balances that consider both the time and physical demands of the assembly tasks: a ranking heuristic, a combinatorial genetic algorithm, and a problem space genetic algorithm. Each heuristic was tested using 100 assembly line balancing problems. Incorporating physical demands using these algorithms does impact the assembly line configuration. Results indicated that the problem space genetic algorithm was the most adept at finding line balances that minimized cycle time and physical workload placed upon participants. Benefits of using this approach in manufacturing environments are discussed.

Collaboration


Dive into the Bryan A. Norman's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Bruce Y. Lee

Johns Hopkins University

View shared research outputs
Top Co-Authors

Avatar

Shawn T. Brown

Pittsburgh Supercomputing Center

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Sheng I. Chen

University of Pittsburgh

View shared research outputs
Top Co-Authors

Avatar

Joel S. Welling

Pittsburgh Supercomputing Center

View shared research outputs
Top Co-Authors

Avatar

James C. Bean

University of Pittsburgh

View shared research outputs
Top Co-Authors

Avatar

Erin Claypool

University of Pittsburgh

View shared research outputs
Researchain Logo
Decentralizing Knowledge