Two-machine open shop scheduling with an availability constraint

We study a two-machine open shop scheduling problem, in which one machine is not available for processing during a given time interval. The objective is to minimize the makespan. We show that the problem is NP-hard and present an approximation algorithm with a worst-case ratio of 4/3.

[Conference report] Magic and mathematics: The life and work of John Dee. National Maritime Museum, Greenwich, 13-14 June 2003

Tony Mann provides a report of a two-day meeting "Magic and mathematics: The life and work of John Dee" held from 13-14 June 2003 at the National Maritime Museum, Greenwich.

[Book review] Mathematics and Culture II

Review of Mathematics and Culture II. Visual Perfection: Mathematics and Creativity, Michele Emmer (Ed.), Springer, 2005 ISBN: 978-3-540-21368-0

BSHM meetings: BMS History of Mathematics Splinter Group

Introduction to abstracts from papers given at BMS History of Mathematics Splinter Group, held 17 April 2007, in Swansea.

BSHM meetings: British Mathematics Colloquium

Report on the British Mathematics Colloquium, which took place in York, 25-28 March 2008. Also includes abstracts of the individual talks.

[BSHM meetings] Topics in the history of financial mathematics: early commerce to chaos in modern stock markets

This account provides an overview of the study day, entitled 'Topics in the History of Financial Mathematics: Early commerce to chaos in modern stock markets,' held by the British Society for the History of Mathematics jointly with Gresham College, at Gresham College, London on 25th April 2008. The series of talks explored the development of mathematics and mathematical techniques in a commercial and financial context.

Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval

In this note, we consider the scheduling problem of minimizing the sum of the weighted completion times on a single machine with one non-availability interval on the machine under the non-resumable scenario. Together with a recent 2-approximation algorithm designed by Kacem [I. Kacem, Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval, Computers & Industrial Engineering 54 (2008) 401–410], this paper is the first successful attempt to develop a constant ratio approximation algorithm for this problem. We present two approaches to designing such an algorithm. Our best algorithm guarantees a worst-case performance ratio of 2+ε. © 2008 Elsevier B.V. All rights reserved.

Reviews: making mathematics with needlework

Review of Making Mathematics with Needlework, edited by Sarah-Marie Belcastro and Carolyn Yackel, published by AK Peters Ltd, 2007 (ISBN 978-1-56881-331-8).

[Book review] Collaborative learning in mathematics

Review of: Collaborative Learning in Mathematics: A challenge to our beliefs and practices by Malcolm Swan, National Institute of Adult Continuing Education, paperback £24.95, ISBN 981-1-86201-311-7; hardback £44.95, ISBN 978-1-86201-316-2.

Some issues on assessment methods and learning in mathematics and statistics

This paper looks at the application of some of the assessment methods in practice with the view to enhance students’ learning in mathematics and statistics. It explores the effective application of assessment methods and highlights the issues or problems, and ways of avoiding them, related to some of the common methods of assessing mathematical and statistical learning. Some observations made by the author on good assessment practice and useful approaches employed at his institution in designing and applying assessment methods are discussed. Successful strategies in implementing assessment methods at different levels are described.