Managing small-scale commercial fisheries for adaptive capacity: Insights from dynamic social-ecological drivers of change in Monterey Bay

Globally, small-scale fisheries (SSFs) are driven by climate, governance, and market factors of social-ecological change, presenting both challenges and opportunities. The ability of small-scale fishermen and buyers to adapt to changing conditions allows participants to survive economic or environmental disturbances and to benefit from optimal conditions. This study presented here identifies key large-scale factors that drive SSFs in California to shift focus among targets and that dictate long-term trends in landings. We use Elinor Ostrom’s Social-Ecological System (SES) framework to apply an interdisciplinary approach when identifying potential factors and when understanding the complex dynamics of these fisheries. We analyzed the interactions among Monterey Bay SSFs over the past four decades since the passage of the Magnuson Stevens Fisheries Conservation and Management Act of 1976. In this region, the Pacific sardine (Sardinops sagax), northern anchovy (Engraulis mordax), and market squid (Loligo opalescens) fisheries comprise a tightly linked system where shifting focus among fisheries is a key element to adaptive capacity and reduced social and ecological vulnerability. Using a cluster analysis of landings, we identified four modes from 1974 to 2012 that were dominated by squid, sardine, anchovy, or lacked any dominance, enabling us to identify external drivers attributed to a change in fishery dominance during seven distinct transition points. Overall, we show that market and climate factors drive the transitions among dominance modes. Governance phases most dictated long-term trends in landings and are best viewed as a response to changes in perceived biomass and thus a proxy for biomass. Our findings suggest that globally, small-scale fishery managers should consider enabling shifts in effort among fisheries and retaining existing flexibility, as adaptive capacity is a critical determinant for social and ecological resilience.

Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-to-Order Operations

The increasing emphasis on mass customization, shortened product lifecycles, synchronized supply chains, when coupled with advances in information system, is driving most firms towards make-to-order (MTO) operations. Increasing global competition, lower profit margins, and higher customer expectations force the MTO firms to plan its capacity by managing the effective demand. The goal of this research was to maximize the operational profits of a make-to-order operation by selectively accepting incoming customer orders and simultaneously allocating capacity for them at the sales stage. For integrating the two decisions, a Mixed-Integer Linear Program (MILP) was formulated which can aid an operations manager in an MTO environment to select a set of potential customer orders such that all the selected orders are fulfilled by their deadline. The proposed model combines order acceptance/rejection decision with detailed scheduling. Experiments with the formulation indicate that for larger problem sizes, the computational time required to determine an optimal solution is prohibitive. This formulation inherits a block diagonal structure, and can be decomposed into one or more sub-problems (i.e. one sub-problem for each customer order) and a master problem by applying Dantzig-Wolfe’s decomposition principles. To efficiently solve the original MILP, an exact Branch-and-Price algorithm was successfully developed. Various approximation algorithms were developed to further improve the runtime. Experiments conducted unequivocally show the efficiency of these algorithms compared to a commercial optimization solver. The existing literature addresses the static order acceptance problem for a single machine environment having regular capacity with an objective to maximize profits and a penalty for tardiness. This dissertation has solved the order acceptance and capacity planning problem for a job shop environment with multiple resources. Both regular and overtime resources is considered. The Branch-and-Price algorithms developed in this dissertation are faster and can be incorporated in a decision support system which can be used on a daily basis to help make intelligent decisions in a MTO operation.