A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization

This article deals with the development of a heuristic for scheduling in a flowshop with the objective of minimizing the makespan and maximum tardiness of a job. The heuristic makes use of the simulated annealing technique. The proposed heuristic is relatively evaluated against the existing heuristic for scheduling to minimize the weighted sum of the makespan and maximum tardiness of a job. The results of the computational evaluation reveal that the proposed heuristic performs better than the existing one.     

Determinants of Migrant Career Success: A Study of Recent Skilled Migrants in Australia

Australia has been aggressively pursuing skilled migrants to sustain its population and foster economic growth. However, many skilled migrants experience a downward career move upon migration to Australia. Based on a survey of recent skilled migrants, this study investigates how individual (age, years of settlement, qualifications), national/societal (citizenship and settlement), and organization-level (climate of inclusion) factors influence their career success. Overall, we found that: (1) age at migration matters more than length of settlement in predicting skilled migrant career success; (2) citizenship uptake and living in a neighbourhood with a greater number of families from the same country of origin facilitate post-migration career success; and (3) perceptions of one's social/informal networks in the workplace – a dimension of perceived organizational climate of inclusion – also have a positive impact on migrant career outcomes.     

The economic commission for Asia and the Far East program to assist fertility control

Demography - In conclusion, the ECAFE program to assist fertility control is vigorous and expanding. For demographers, this program, and especially the meetings of the technical groups, should have...     

A comparative analysis of two different approaches to scheduling in flexible flow shops

This work is an investigation about the relative effectiveness of two approaches to scheduling in flexible flow shops: one approach advocating the possible use of different dispatching rules at different stages of the flow shop, and the other suggesting the use of the same dispatching rule at all the stages of the flow shop. In the latter approach, the dispatching rule contains the information related to both process time and duedate. Both approaches aim at the minimization of measures related to flowtime and tardiness of jobs. This paper essentially is an attempt at exploring the relative effectiveness of these two approaches to scheduling.     

Efficient jobshop dispatching rules: Further developments

Many dispatching rules for scheduling in dynamic jobshops have been proposed over many years. The research issues in jobshop scheduling seem to be still open in the sense that no single rule has been found to be the best under all shopfloor conditions even with respect to one single measure of performance. Added to this problem, there are several measures of performance, e.g. the minimizations of mean, maximum and variance of flowtime, percentage of tardy jobs, and mean, maximum and variance of tardiness of jobs. Recent studies have reported the development of more efficient dispatching rules than the popular rules, e.g. SPT, COVERT, MOD and ATC. This study is an attempt to improve some of the recently reported dispatching rules. An extensive simulation study reveals that the improved rules developed in the present study appear to be quite effective in minimizing mean flowtime, and maximum tardiness and variance of tardiness of jobs.     

Heuristics for scheduling in a flowshop with setup,processing and removal times separated

The problem of scheduling in a flowshop, where setup, processing and removal times are separable, is considered with the objective of minimizing makespan. Heuristic algorithms are developed by the introduction of simplifying assumptions into the scheduling problem under study. An improvement method is incorporated in the heuristics to enhance the quality of their solutions. The proposed heuristics and an existing heuristic are evaluated by a large number of randomly generated problems. The results of an extensive computational investigation for various values of parameters are presented.