In this paper, a new model of capacitated lot sizing and scheduling in a permutation flow shop is developed. In this model demand can be totally backlogged. Setups can be carryover and are sequence-dependent. It is well-known from literatures that capacitated lot sizing problem in permutation flow shop systems are NP-hard. This means the model is solved in polynomial time and metaheuristics alg...

In this study, a new servo control system is presented for the overhead crane based on discrete-time state feedback approach. It provides both robust tracking and load swing suppression. Inspired from independent joint and computed torque control in robot manipulator field, a new model is derived in which the crane actuators are considered as the main plant. The crane nonlinearities are then tr...

Existing one-time password (OTP) schemes suffer several drawbacks. Token-based systems are expensive, while software-based schemes rely on one-time passwords that are dependent on each other.-There are disadvantages to authentication schemes that rely on dependent OTPs. It is difficult to replicate the authentication server without lowering security. Also, current authentication schemes based o...

One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the processing times of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages specially structured flow shop scheduling in which the processing times of the jobs a...

We present a simple algorithm for the maximum independent set problem in an n-vertex graph with degree bounded by 4, which runs in O∗(1.1455n) time and improves all previous algorithms for this problem. In this paper, we use the “Measure and Conquer method” to analyze the running time bound, and use some good reduction and branching rules with a new idea on setting weights to obtain the improve...

We study independent component analysis with noisy observations. We present, for the first time in the literature, consistent, polynomial-time algorithms to recover non-Gaussian source signals and the mixing matrix with a reconstruction error that vanishes at a 1/ √ T rate using T observations and scales only polynomially with the natural parameters of the problem. Our algorithms and analysis a...