Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment

The paper considers the single machine due date assignment and scheduling problems with n jobs in which the due dates are to be obtained from the processing times by adding a positive slack q. A schedule is feasible if there are no tardy jobs and the job sequence respects given precedence constraints. The value of q is chosen so as to minimize a function ϕ(F,q) which is non-decreasing in each of its arguments, where F is a certain non-decreasing earliness penalty function. Once q is chosen or fixed, the corresponding scheduling problem is to find a feasible schedule with the minimum value of function F. In the case of arbitrary precedence constraints the problems under consideration are shown to be NP-hard in the strong sense even for F being total earliness. If the precedence constraints are defined by a series-parallel graph, both scheduling and due date assignment problems are proved solvable in time, provided that F is either the sum of linear functions or the sum of exponential functions. The running time of the algorithms can be reduced to if the jobs are independent. Scope and purpose We consider the single machine due date assignment and scheduling problems and design fast algorithms for their solution under a wide range of assumptions. The problems under consideration arise in production planning when the management is faced with a problem of setting the realistic due dates for a number of orders. The due dates of the orders are determined by increasing the time needed for their fulfillment by a common positive slack. If the slack is set to be large enough, the due dates can be easily maintained, thereby producing a good image of the firm. This, however, may result in the substantial holding cost of the finished products before they are brought to the customer. The objective is to explore the trade-off between the size of the slack and the arising holding costs for the early orders.

Production of lightweight aggregate from industrial waste and carbon dioxide

The concomitant recycling of waste and carbon dioxide emissions is the subject of developing technology designed to close the industrial process loop and facilitate the bulk-re-use of waste in, for example, construction. The present work discusses a treatment step that employs accelerated carbonation to convert gaseous carbon dioxide into solid calcium carbonate through a reaction with industrial thermal residues. Treatment by accelerated carbonation enabled a synthetic aggregate to be made from thermal residues and waste quarry fines. The aggregates produced had a bulk density below 1000 kg/m3 and a high water absorption capacity. Aggregate crushing strengths were between 30% and 90% stronger than the proprietary lightweight expanded clay aggregate available in the UK. Cast concrete blocks containing the carbonated aggregate achieve compressive strengths of 24 MPa, making them suitable for use with concrete exposed to non-aggressive service environments. The energy intensive firing and sintering processes traditionally required to produce lightweight aggregates can now be augmented by a cold-bonding, low energy method that contributes to the reduction of green house gases to the atmosphere.

An information system to exploit the use of metadata within film and television production

The article focuses on an information system to exploit the use of metadata within film and television production. It is noted that the television and film industries are used to working on big projects. This involves the use of actual film, video tape, and P.E.R.T charts for project planning. Scripts are in most instances revised. It is essential to attach information on these in order to manage, track and retrieve them. The use of metadata eases the operations involved in these industries.

An information system to exploit the use of metadata within film and television production

The television and film industries are used to working on large projects. These projects use media and documents of various types, ranging from actual film and videotape to items such as PERT charts for project planning. Some items, such as scripts, evolve over a period and go through many versions. It is often necessary to attach information to these “objects” in order to manage, track, and retrieve them. On large productions there may be hundreds of personnel who need access to this material and who in their turn generate new items which form some part of the final production. The requirements for this industry in terms of an information system may be generalized and a distributed software architecture built, primarily using the internet, to serve the needs of these projects. This architecture must enable potentially very large collections of objects to be managed in a secure environment with distributed responsibilities held by many working on the production. Copyright © 2005 by the Society of Motion Picture and Television Engineers, Inc.