Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Roger B. Grinde"'
Autor:
Roger B. Grinde
Publikováno v:
Information Technology and Management Science; Vol 20, No 1 (2017): Information Technology and Management Science; 79-84
Information Technology and Management Science, Vol 20, Iss 1, Pp 79-84 (2017)
Information Technology and Management Science, Vol 20, Iss 1, Pp 79-84 (2017)
A bi-modal routing problem is solved using a heuristic approach. Motivated by a recreational hiking application, the problem is similar to routing problems in business with two transport modes. The problem decomposes into a set covering problem (SCP)
Publikováno v:
Technology Analysis & Strategic Management. 23:175-192
Developments in nanotechnology are poised to have a pervasive effect on various industries for years to come and nanotechnology management research is beginning to appear in peer-reviewed management journals. Much of the research on this early, emerg
Autor:
Roger B. Grinde, Jill A. Kammermeyer
Publikováno v:
INFORMS Transactions on Education. 4:23-36
This paper presents a theme-based approach for individual and group assignments in an undergraduate Management Science course. We have been using this approach since Fall 2001, with three different themes. In Fall 2001 we used a “generic” enterta
Autor:
Roger B. Grinde, Karen Daniels
Publikováno v:
IIE Transactions. 31:763-769
A trim placement problem from the apparel industry is presented and solved. The problem is related to cutting and packing problems, which have received attention in the literature for close to 40 years. The problem is motivated by a pants layout prob
Autor:
Tom M. Cavalier, Roger B. Grinde
Publikováno v:
Computers & Operations Research. 24:231-251
This article addresses the two-polygon containment problem. The problem is to determine if two polygons, denoted P1, and P2, can fit inside a fixed polygon Q without overlap. The case when P1 and P2 are allowed to translate and rotate and all three p
Autor:
Roger B. Grinde, Tom M. Cavalier
Publikováno v:
European Journal of Operational Research. 92:368-386
This paper investigates the polygon containment problem, to determine whether a given polygon can be translated and/or rotated to fit inside a fixed polygon. A primary application is the stock cutting problem, when pieces have irregular shapes and ca
Autor:
Tom M. Cavalier, Roger B. Grinde
Publikováno v:
European Journal of Operational Research. 84:522-538
The problem of cutting parts from a piece of material occurs in a number of settings. When the pieces to be cut are non-rectangular, the problem is called the irregular pattern layout problem (or nesting problem). This problem occurs in sheet metal a
Autor:
Roger B. Grinde, José A. Ventura
Publikováno v:
International Journal of Production Research. 32:2031-2047
A mathematical programming formulation is presented for the problem of finding the centre and radius of the sphere such that the largest distance from a sample of points to the boundary of the sphere is minimized. This problem has application in sphe
Publikováno v:
Journal of Quality Technology. 19:204-215
ANSI/ASQC Z1.4 is a widely used attributes acceptance sampling system. The latest revision of the standard makes optional the use of limit numbers for reduced inspection. This paper presents a Markov model of the sampling system without limit numbers
Publikováno v:
International Journal of Production Research. 25:301-313
ANSI Zl-4 is a set of sampling plans and procedures for sampling inspection by attributes which includes provisions for switching between normal, tightened, and reduced inspections as a function of the quality history. In the latest version of ANSI Z