社会工作毕业生就业状况调查报告—以N学院社工系毕业生为例

为了解社会工作专业毕业生的就业情况，课题小组设计了一份有关社会工作就业状况的调查问卷，并对已就业的四位社工专业的学生进行了个案访谈。对问卷的分析及个案的访谈将有助我们更好地了解社会工作专业的教育状况和学生的就业状况，这有助于改善社会工作专业的教学，更好地促进专业成长。     

从普利策的新闻观看我国大众化报纸的办刊理念

19世纪初期,欧美发达的资本主义国家,已经迎来了大众化报纸的蓬勃兴起。普利策经营的《纽约世界报》就是这一时期成功的典范之一。20世纪90年代中叶,以《华西都市报》为代表的大众化报纸异军突起,也成为我国报业新时期发展的一个显著标志。20世纪初,我国日渐成熟的都市类大众化报纸应该以史为鉴,在服务市民、引领生活的同时,更要关注民生疾苦,强化舆论监督,牢记社会责任。     

A genetic algorithm for assembly line balancing

Assembly line balancing is a very important aspect in any mass production setup. However, finding the optimal balance is a very difficult proposition because of the computational complexity involved. Hence sub-optimal solutions are preferred over optimal solutions. In this work, a genetic algorithm (GA) is presented for obtaining good quality solutions for assembly line balancing problems. A major feature of GA is the ability to take care of a variety of objective functions. A modified GA working with two populations, one of which allows infeasible solutions, and exchange of specimens at regular intervals is proposed for handling irregular search spaces. The experimental results obtained with a single population, as well as two populations are encouraging.     

‘Cukup for me to be successful in this country’: ‘staying’ among left‐behind young women in Indonesia's migrant‐sending villages

By examining the aspirations of young, rural Indonesian women who, unlike their parents, want to stay behind rather than migrate for work, we look at how these women's experiences of feeling left‐behind affect their quests for alternative futures. Using a household relational lens, we employ the mediating concept of enough (cukup) to analyse the aspirations of young women wishing to remain at home. By focusing on their commitment to inter‐generational continuity and care rather than a lack of choice, we are able to offset the discourses associated with the culture of migration and its accompanying remittance euphoria. Our findings showed three main reasons for their choice. First, these young women pursue remittance‐funded higher education as a counter to parental sacrifice. Second, staying allows them both to provide the hands‐on care they themselves were denied as children and to pursue meaningful local careers. Third, the idea that migration has been ‘enough’ is a rational response to the social risks with which migration confronts a family.     

EXISTENCE AND DERIVATION OF FORECAST HORIZONS IN A DYNAMIC LOT SIZE MODEL WITH NONDECREASING HOLDING COSTS

We are concerned with a discrete-time undiscounted dynamic lot size model in which demand and the production setup cost are constant for an initial few periods and the holding cost of inventory is an arbitrary nondecreasing function assumed to be stationary (i.e., explicitly independent of time) in the same initial few periods. We show that there exists a finite forecast horizon in our model and obtain an explicit formula for it. In addition, we obtain fairly general conditions under which the existence of a solution horizon in the model implies the existence of a forecast horizon. We also derive an explicit formula for the minimal solution horizon. These results extend the earlier ones obtained for the dynamic lot size model with linearly increasing holding costs.     

Scheduling of unrelated parallel machines when machine availability is specified

Scheduling problems typically assume uninterrupted availability of machines such that jobs can be processed at any time during this uninterrupted period. However, this assumption is seldom valid in reality. For a variety of reasons, e.g. machine adjustments, shift changes, planned maintenance, etc. machines are available only at specified times. The duration for which the machine is not available is known as the vacation. This paper considers the problem of scheduling jobs on unrelated parallel machines when machine vacations are specified. Two cases are considered, first, when the machine vacations are known apriori, and the second, when these constraints are not known apriori. Algorithms have been developed for both models, and computational results are also reported.     

CAPACITY AND PRODUCTION DECISIONS IN STOCHASTIC MANUFACTURING SYSTEMS: AN ASYMPTOTIC OPTIMAL HIERARCHICAL APPROACH

We present a new paradigm of hierarchical decision making in production planning and capacity expansion problems under uncertainty. We show that under reasonable assumptions, the strategic level management can base the capacity decision on aggregated information from the shopfloor, and the operational level management, given this decision, can derive a production plan for the system, without too large a loss in optimality when compared to simultaneous determination of optimal capacity and production decisions. The results are obtained via an asymptotic analysis of a manufacturing system with convex costs, constant demand, and with machines subject to random breakdown and repair. The decision variables are purchase time of a new machine at a given fixed cost and production plans before and after the purchase. The objective is to minimize the discounted costs of investment, production, inventories, and backlogs. If the rate of change in machine states such as up and down is assumed to be much larger than the rate of discounting costs, one obtains a simpler limiting problem in which the random capacity is replaced by its mean. We develop methods for constructing asymptotically optimal decisions for the original problem from the optimal decisions for the limiting problem. We obtain error estimates for these constructed decisions.     

Selection of a sampling plan indexed with maximum allowable average outgoing quality

SUMMARY This paper introduces a new concept of maximum allowable average outgoing quality MAAOQ , which is the average outgoing quality at the inflection point. The procedure for designing a single sampling plan indexed through the maximum allowable per cent defective and MAAOQ is stated. Tables are constructed for the selection of parameters for the plan, and parametric conversions are also studied.     

A SINGLE-MACHINE SCHEDULING MODEL WITH FIXED-INTERVAL DELIVERIES

We consider an environment where a production facility modeled as a single machine needs to assign delivery dates to several orders and find a feasible sequence. Tardy jobs are not allowed. The delivery dates are to be at prespecified fixed intervals. The objective is to minimize the due date penalty and the cost of earliness. We provide a dynamic programming-based solution procedure that runs in polynomial time. We develop several dominance results that reduced the computational requirement by an order of magnitude in our computational study.