Single machine batch scheduling to minimize total completion time and resource consumption costs

In this paper we study the single-machine batch scheduling problem under batch availability, where both setup and job processing times are controllable by allocating a continuously divisible nonrenewable resource. Under batch availability a set of jobs is processed contiguously and completed together, when the processing of the last job in the batch is finished. We present polynomial time algorithms to find the job sequence, the partition of the job sequence into batches and the resource allocation, which minimize the total completion time or the total production cost (inventory plus resource costs).     

Towards a contingent approach of customer involvement in defence projects: An exploratory study

This paper reports the main results of an exploratory, multiple case study investigating customer involvement practices in system development projects in the Israeli defence industry. The study proposes and examines a theoretical contingency model regarding the effect of customer involvement modes on project success, moderated by project characteristics. It focuses specifically on the working mode of customers' representatives along the continuum between external supervision to full participation in project activities.     

A survey on offline scheduling with rejection

In classical deterministic scheduling problems, it is assumed that all jobs have to be processed. However, in many practical cases, mostly in highly loaded make-to-order production systems, accepting all jobs may cause a delay in the completion of orders which in turn may lead to high inventory and tardiness costs. Thus, in such systems, the firm may wish to reject the processing of some jobs by either outsourcing them or rejecting them altogether. The field of scheduling with rejection provides schemes for coordinated sales and production decisions by grouping them into a single model. Since scheduling problems with rejection are very interesting both from a practical and a theoretical point of view, they have received a great deal of attention from researchers over the last decade. The purpose of this survey is to offer a unified framework for offline scheduling with rejection by presenting an up-to-date survey of the results in this field. Moreover, we highlight the close connection between scheduling with rejection and other fields of research such as scheduling with controllable processing times and scheduling with due date assignment, and include some new results which we obtained for open problems.     

A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates

We study a single-machine scheduling problem in a flexible framework where both job processing times and due dates are decision variables to be determined by the scheduler. The model can also be applied for quoting delivery times when some parts of the jobs may be outsourced. We analyze the problem for two due date assignment methods and a convex resource consumption function. For each due date assignment method, we provide a bicriteria analysis where the first criterion is to minimize the total weighted number of tardy jobs plus due date assignment cost, and the second criterion is to minimize total weighted resource consumption. We consider four different models for treating the two criteria. Although the problem of minimizing a single integrated objective function can be solved in polynomial time, we prove that the three bicriteria models are NP\mathcal{NP}-hard for both due date assignment methods. We also present special cases, which frequently occur in practice, and in which all four models are polynomially solvable.     

Thermal polymerization of a brominated flame retardant in a glass‐fiber‐reinforced polypropylene—quantitative analysis

Pentabromobenzylacrylate (PBBA) is a possible candidate for use as a fire retardant (FR) in polypropylene (PP) composites. While PBBA imparts FR properties to the PP composite, it also affects adversely its mechanical properties. The FR may undergo thermal polymerization or grafting to the PP chains during processing. To study the effect of the different forms of FR (monomer, polymerized, or grafted) on composite properties, we have quantified the extent of FR polymerization and extent of grafting onto the PP chains. Fourier transform infrared microscopy was used in this work to determine the extent of polymerization and the spatial distribution of the FR. The latter was found to be homogeneous throughout the composite. Thermal polymerization of the FR during extrusion is varied mainly by the addition of an antioxidant. The grafting process of the FR onto PP depends on the degree of thermal polymerization, and therefore on the addition of antioxidant. The limiting value for grafting achieved at full polymerization is ～10% w/w. The grafted FR was found to have a significant effect on PP crystallinity, and hence it is expected to affect the mechanical properties as well. Bromine analysis indicates the FR has reacted with filler surfaces as well. © 2003 Wiley Periodicals, Inc. J Appl Polym Sci 88: 1506–1515, 2003     

On the generation of broad-band beams for a nondispersivetime-signal transmission

A novel aperture synthesis method is proposed for a broad-band beam (BB) generation, which supports a nondispersive time-signal transmission to a single observation plane. This plane, regarded here as the image plane (IP), is perpendicular to the axis of propagation and its location can be varied continuously from the near-field zone to the far-field zone. The spatial field of the BB at the IP can be shaped by modifying the classical spatial filtering synthesis techniques to construct a predetermined localized space-time (ST) field. The method characteristics, effectiveness, and simplicity, are demonstrated through two opposing analytic examples: Gaussian and rectangular source-field-distributions (SFD's)     

Placing and maintaining a core node in wirelessad hoc networks

Wireless ad hoc networks are characterized by several performance metrics, such as bandwidth, transport, delay, power, etc. These networks are examined by constructing a tree network. A core node is usually chosen to be the median or center of the multicast tree network with a tendency to minimize a performance metric, such as delay or transport. In this paper, we present a new efficient strategy for constructing and maintaining a core node in a multicast tree for wireless ad hoc networks undergoing dynamic changes, based on local information. The new core (centdian) function is defined by a convex combination signifying total transport and delay metrics. We provide two bounds of O(d) and O(d+l) time for maintaining the centdian using local updates, where l is the hop count between the new center and the new centdian, and d is the diameter of the tree network. We also show an O(n log n) time solution for finding the centdian in the Euclidian complete network. Finally, an extensive simulation for the construction algorithm and the maintenance algorithm is presented along with an interesting observation. Copyright © 2009 John Wiley & Sons, Ltd.