Single Machine (single + machine)

Distribution by Scientific Domains


Selected Abstracts


An evaluation of actual and simulated smoke properties

FIRE AND MATERIALS, Issue 2 2005
Jill Suo-Anttila
Abstract Federal regulations require that aircraft cargo compartment smoke detection systems be certified by testing their operation in flight. For safety reasons, only simulated smoke sources are permitted in these certification tests. To provide insight into smoke detection certification in cargo compartments, this research investigates the morphology, transport and optical properties of actual and simulated smoke sources. Experimental data show the morphology of the particulate in smoke from flaming fires is considerably different from simulated smoke. Although the detection of smoldering fires is important as well, only a qualitative assessment and comparison of smoldering sources was possible; therefore, efforts were concentrated on the quantitative comparison of smoke from flaming fires and smoke generators. The particulate for all three different flaming fires was solid with similar morphological properties. Simulated smoke was composed of relatively large liquid droplets, and considerably different size droplets can be produced using a single machine. Transport behavior modeling showed that both the actual and simulated smoke particulates are sufficiently small to follow the overall gas flow. However, actual smoke transport will be buoyancy driven due to the increased temperature, while the simulated smoke temperature is typically low and the release may be momentum driven. The morphology of the actual and simulated smoke were then used to calculate their optical properties. In contrast to the actual smoke from a flaming fire, which is dominated by absorption, all of the extinction for the simulated smoke is due to scattering. This difference could have an impact on detection criteria and hence the alarm time for photoelectic smoke detectors since they alarm based on the scattering properties of the smoke. Copyright © 2004 John Wiley & Sons, Ltd. [source]


Self evolution algorithm to minimize earliness and tardiness penalties with a common due date on a single machine

IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, Issue 6 2008
Wei Weng Non-member
Abstract Earliness and tardiness penalties are designed for such scheduling problems where the popular Just-In-Time (JIT) concept is considered to be of significant importance. In this paper, a self evolution (SE) algorithm is proposed to solve the problem of single-machine total earliness and tardiness penalties with a common due date. Up to now, no specific attention has been paid to straddling V-shaped schedules of such problems, which may be better than pure V-shaped schedules for the early due date cases; and no specific discussions have been made on the start time setting of the first job in a schedule. Therefore, in this research, efforts have been made on digging out the straddling V-shaped schedules, improving the efficiency of setting the start time of a schedule, and reducing the execution time. In addition, a new RHRM approach is proposed to create the initial solution for evolution, which helps in achieving the fast contingency of the algorithm. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs from the OR Library, and the results show that the proposed SE algorithm delivers much higher efficiency in finding optimal or near-optimal solutions with both better results in total penalties and significant execution time reduction. Copyright © 2008 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc. [source]


Integrated production scheduling and preventive maintenance planning for a single machine under a cumulative damage failure process

NAVAL RESEARCH LOGISTICS: AN INTERNATIONAL JOURNAL, Issue 6 2007
Yarlin Kuo
Abstract This paper finds the optimal integrated production schedule and preventive maintenance plan for a single machine exposed under a cumulative damage process, and investigates how the optimal preventive maintenance plan interacts with the optimal production schedule. The goal is to minimize the total tardiness. The optimal policy possesses the following properties: Under arbitrary maintenance plan when jobs have common processing time, and different due dates, the optimal production schedule is to order the jobs by earliest due date first rule; and when jobs have common due date and different processing times, the optimal production schedule is shortest processing time first. The optimal maintenance plan is of control limit type under any arbitrary production schedule when machine is exposed under a cumulative damage failure process. Numerical studies on the optimal maintenance control limit of the maintenance plan indicate that as the number of jobs to be scheduled increases, the effect of jobs due dates on the optimal maintenance control limit diminishes. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 [source]


Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine

NAVAL RESEARCH LOGISTICS: AN INTERNATIONAL JOURNAL, Issue 3 2003
Stéphane Dauzère-Pérès
This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed-integer linear programming formulation. By relaxing some constraints, a Lagrangean relaxation algorithm is designed which gives both lower and upper bounds. The special case where jobs have equal weights is analyzed. Computational results are presented and, although the duality gap becomes larger with the number of jobs, it is possible to solve problems of more than 100 jobs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003 [source]


Multiple common due dates

NAVAL RESEARCH LOGISTICS: AN INTERNATIONAL JOURNAL, Issue 4 2001
Bernard Dickman
Abstract Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293,298, 2001 [source]


Stochastic scheduling problem with varying weight for each job

ASIA-PACIFIC JOURNAL OF CHEMICAL ENGINEERING, Issue 4 2010
Manzhan Gu
Abstract This paper studies the preemptive stochastic online scheduling problem, which is a simple combination of online and stochastic scheduling. The processing times of jobs are assumed to be subject to independent probability distributions, and we assume that jobs arrive overtime, which means there is no knowledge about the jobs that arrive in the future. We particularly consider the preemptive setting where a job is allowed to be interrupted during its processing. The weight (holding cost ratio) associated with each job may change during its processing, and the objective is to minimize the expected value of total holding cost for all jobs. For the single and m identical machine problems, we propose scheduling policies, SPGS [semi-preemptive Gittins Index Priority Policy (GIPP) on single machine] and SPGI (semi-preemptive GIPP on identical machines), respectively, both of which are proved to be constant-factor approximation. Copyright © 2009 Curtin University of Technology and John Wiley & Sons, Ltd. [source]