Steady-state dynamic simulation of a variable reluctance stepping motor is carried out by applying two different excitation voltages. First a single-step voltage is applied to the motor, and a sinusoidal voltage, as the first term of Fourier series of the single-step voltage, is then used as the input voltage of the motor. In both cases plots of machine torque, current and speed are presented. ...

  In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...

This paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. We assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. In this paper, we present an Artificial Imm...

In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...

We design a fast ascent direction algorithm for the Lagrangian dual problem of the single-machine scheduling problem of minimizing total weighted completion time subject to precedence constraints. We show that designing such an algorithm is relatively simple if a scheduling problem is formulated in terms of the job completion times rather than as an 0-1 linear program. Also, we show that upon t...

This paper studies a multiple-recipe predictive maintenance problem with M/G/1 queueing e ects. The server degrades according to a discrete-time Markov chain and we assume that the controller knows both the machine status and the current number of jobs in the system. The controller's objective is to minimize total discounted costs or long-run average costs which include preventative and correct...

In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effort to design algorithms that are applicable in the presence of uncertainty in the definition of the instance. We study the single machine scheduling problem with the objective to minimize the weighted sum of completion...

We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion time. This problem has attracted much attention in the mathematical programming community since Sidney’s pioneering work in 1975 (Sidney, J. B. 1975. Decomposition algorithms for single machine scheduling with precedence relations and deferral costs. Operations Resear...

In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates. 2004 Published by Elsevier B.V.