Suchergebnisse

This book looks at how both advocacy groups in New Zealand and Australia use political marketing to conduct advocacy and support Israeli and Palestinian public diplomacy and nation branding. The focus lies on their marketing orientation, segmentation/targeting/ positioning (STP), and internal marketing practices. The theoretical framework will draw upon several political marketing frameworks and concepts including the product/sales/market-oriented framework, the STP process, and Petitt's internal stakeholder marketing approaches. The book examines four case studies: (1) the Palestine Solidarity Network Aotearoa (PSNA), (2) the Israel Institute of New Zealand (IINZ), (3) the Australia/Israel & Jewish Affairs Council (AIJAC), and (4) the Australia Palestine Advocacy Network (APAN). To ensure balance and comparison, four groups representing both the pro-Israel and pro-Palestinian camps in NZ and Australia were selected. Other criteria included their broad scope of activity, approachability/accessibility, and connections to state actors through advocacy, public diplomacy, and nation branding. Andrew Lim is a researcher based in New Zealand who is particularly interested in how advocacy groups can contribute to public diplomacy. He is also interested in New Zealand politics, history, and social issues.

AbstractGiven an edge‐distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introduce minimum quantity commitments to balance workloads of suppliers, provide the best possible approximation algorithm, and study its generalizations and specializations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006

"This book is a collection of speeches presented at Singapore Perspectives 2019 by current players in international relations and leading academics and opinion shapers on how the post-Cold War world order, with emphasis on the relations between the United States and China, will affect small states like Singapore and countries in Southeast Asia — at local, national, and regional levels. It features speeches by prominent personalities, such as Singapore Minister for Foreign Affairs Dr Vivian Balakrishnan, former Singapore Foreign Minister Mr George Yeo, and former Indonesian Foreign Minister Dr Marty Natalegawa. Each speaker presents a fresh perspective on important developments in the world today."--

AbstractIn this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.

AbstractIn this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.

AbstractIn this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016

AbstractA major challenge in making supply meet demand is to coordinate transshipments across the supply chain to reduce costs and increase service levels in the face of demand fluctuations, short lead times, warehouse limitations, and transportation and inventory costs. In particular, transshipment through crossdocks, where just‐in‐time objectives prevail, requires precise scheduling between suppliers, crossdocks, and customers. In this work, we study the transshipment problem with supplier and customer time windows where flow is constrained by transportation schedules and warehouse capacities. Transportation is provided by fixed or flexible schedules and lot‐sizing is dealt with through multiple shipments. We develop polynomial‐time algorithms or, otherwise, provide the complexity of the problems studied. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005

AbstractIn this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane‐to‐job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.