cdma2000 1xEV-DO, one of the prominent thirdgeneration mobile communication systems, provides Broadcast and Multicast Services (BCMCS) to meet increasing demand for multimedia data services. Currently, 1xEV-DO schedules broadcast streams using a slot-based static algorithm, which fails to support dynamic environments where broadcast content is added or removed on-line. We propose a dynamic pack...

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. Initially, a job scheduling algorithm that obtains an optimal schedule for a given job sequence is presented. This algorithm is used with a job insertion procedure to generate a group of heuristics that differ on the initial job sequencing rule. Computational...

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

We consider a complex planning problem in integrated steel production. A sequence of coils of sheet metal needs to be color coated in consecutive stages. Different coil geometries and changes of coatings may necessitate time-consuming setup work. In most coating stages one can choose between two parallel color tanks in order to reduce setup times. As a complicating consequence, setup times for ...

NASA has recently announced the New Millennium Program (NMP) to develop \faster, better, cheaper" spacecraft in order to establish a \virtual presence" in space. A crucial element in achieving this vision is onboard spacecraft autonomy, requiring us to automate functions which have traditionally been achieved on ground by humans. These include planning activities, sequencing spacecraft actions,...

In an article entitled “Optimal sequencing of a single machine subject to precedence constraints” E.L. Lawler presented a now classical minmax result for job scheduling. In essence, Lawler’s proof demonstrated that the properties of partially ordered sets were sufficient to solve the posed scheduling problem. These properties are, in fact, common to a more general class of combinatorial structu...

Dynamic, adaptive, real-time embedded control systems are present at any level(s) of an enterprise— e.g., devices in the defense domain such as multi-mode phased array radars and battle management. These embedded systems often include“soft”as well as“hard” time constraints. Jensen’s time/utility functions [4] (or TUFs) allow the semantics of soft time constraints to be precisely specified. A TU...

The parallel machine, distinct due date, early/tardy machine problem closely models the situation faced by ‘Just-In-Time’ (JIT) manufacturers. This paper develops a new method of finding good quality solutions to this scheduling problem by using the neural network. A model for training neural network to sequencing the jobs has been developed based on the vector representation of the early/tardy...

The cdma2000 1xEV-DO mobile communication system provides broadcast and multicast services (BCMCS) to meet an increasing demand for multimedia data services. Currently, broadcast and multicast streams are scheduled using a slot-based static algorithm, which fails to support dynamic environments where broadcast contents are added or removed on-line. We propose a dynamic packet-scheduling algorit...

Traditionally, scheduling research is concerned with the sequencing of tasks on one machine or on several parallel or different machines, subject to a set of constraints. Over the years, researchers have studied a huge variety of problems, developing numerous heuristics, approximation and exact algorithms, and complexity results. Some of these problems are interesting because of their intractab...