To make high-quality research more accessible and easier to explore.

Fields:
2 results ✕ Clear filters

Quality Management and Job Quality: How the ISO 9001 Standard for Quality Management Systems Affects Employees and Employers

Management Science 2010 56(6), 978-996 open access
Several studies have examined how the ISO 9001 quality management systems standard predicts changes in organizational outcomes such as profits. This is the first large-scale study to explore how employee outcomes such as employment, earnings, and health and safety change when employers adopt ISO 9001. We analyzed a matched sample of nearly 1,000 companies in California. ISO 9001 adopters subsequently had far lower organizational death rates than a matched control group of nonadopters. Among surviving employers, ISO adopters had higher growth rates for sales, employment, payroll, and average annual earnings. Injury rates declined slightly for ISO 9001 adopters, although total injury costs did not. These results have implications for organizational theory, managers, and public policy.

CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions

Management Science 2005 51(3), 374-390
Combinatorial auctions where bidders can bid on bundles of items can lead to more economically efficient allocations, but determining the winners is 𝒩𝒫-complete and inapproximable. We present CABOB, a sophisticated optimal search algorithm for the problem. It uses decomposition techniques, upper and lower bounding (also across components), elaborate and dynamically chosen bid-ordering heuristics, and a host of structural observations. CABOB attempts to capture structure in any instance without making assumptions about the instance distribution. Experiments against the fastest prior algorithm, CPLEX 8.0, show that CABOB is often faster, seldom drastically slower, and in many cases drastically faster—especially in cases with structure. CABOB's search runs in linear space and has significantly better anytime performance than CPLEX. We also uncover interesting aspects of the problem itself. First, problems with short bids, which were hard for the first generation of specialized algorithms, are easy. Second, almost all of the CATS distributions are easy, and the run time is virtually unaffected by the number of goods. Third, we test several random restart strategies, showing that they do not help on this problem—the run-time distribution does not have a heavy tail.