Institute for Industrial Mathematics

Beersheba, Israel

Institute for Industrial Mathematics

Beersheba, Israel
SEARCH FILTERS
Time filter
Source Type

Levant A.,Institute for Industrial Mathematics | Pridor A.,Institute for Industrial Mathematics | Ben-Asher J.Z.,Israel Military Industries | Gitizadeh R.,Israel Military Industries | Yaesh I.,Israel Military Industries
European Control Conference, ECC 1999 - Conference Proceedings | Year: 2015

The main problem in controlling real aircraft is information lack, external disturbances and mathematical model inaccuracy. However, combining both high precision and robustness, standard sliding modes feature high-frequency control switching causing the so-called chattering effect. The controller considered in the present paper is based on 2-sliding modes and produces bounded control continuously depending on time. It removes the chattering effect, reveals significant adaptive properties and guarantees precise constraint fulfillment within a finite time. The general approach is demonstrated by a solution of a real-life pitch control problem. Results of computer simulation and of actual flight experiments are presented. © 1999 EUCA.


Che A.,Northwestern Polytechnical University | Lv K.,Northwestern Polytechnical University | Levner E.,College of Logistics | Kats V.,Institute for Industrial Mathematics
ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control | Year: 2015

This paper investigates a single machine scheduling problem to minimize energy consumption with bounded maximum tardiness. A set of jobs are to be processed on a single machine which is speed-scalable. Each job is characterized by its release time, deadline and processing time. The machine can process only one job with some speed at a time. No preemption is allowed. Since energy consumption is associated with the processing speed, both job sequencing and speed choosing decisions have to be made. Two MILP (mixed integer linear programming) models, which respectively use dichotomous constraints and assignment constraints to model the processing sequence of jobs, are built for this problem. The models are implemented in C++ and solved by CPLEX. Computational results with randomly generated instances demonstrate that the model using assignment constraints is much more efficient than that with dichotomous constraints. © 2015 IEEE.


Kats V.,Institute for Industrial Mathematics | Levner E.,Holon Institute of Technology
Journal of Scheduling | Year: 2011

Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, that is, schedules in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and operation durations are chosen from prescribed intervals. A strongly polynomial algorithm of time complexity O(m 8log∈m) is proposed. © 2010 Springer Science+Business Media, LLC.


Levant A.,Institute for Industrial Mathematics
European Control Conference, ECC 1999 - Conference Proceedings | Year: 2015

Featuring exactness and robustness, standard sliding mode may also cause the so-called chattering effect. Having hidden the switching in higher derivatives of output variables, higher order sliding modes preserve or generalize the main properties of standard sliding mode and remove the chattering effect. With finite convergence time, the presented controllers provide for full real-time control of the output variable if the relative degree of the dynamic system is known. Used together with recently developed real-time robust exact differentiators, these controllers actually need only measurements of the controlled output variable. © 1999 EUCA.


Kats V.,Institute for Industrial Mathematics | Levner E.,Bar - Ilan University
Computers and Industrial Engineering | Year: 2011

In this paper we revisit and extend the algorithm for the cyclic project scheduling problem which was originally proposed by Romanovskii (1967). While the algorithm has been derived for fixed numerical data, we show how it can be extended to handle the problems with interval data. We also propose a new algorithm for the cyclic scheduling problem with interval data that extends the parametric method developed by Megiddo (1979) and runs in strongly polynomial time. © 2010 Elsevier Ltd. All rights reserved.


Kats V.,Institute for Industrial Mathematics | Levner E.,Bar - Ilan University
Journal of Scheduling | Year: 2012

This note discusses the pioneering role and main contributions of V.S. Tanaev in the field of cyclic robotic flowshop scheduling. Open questions (either explicitly or implicitly) posed in his papers and kept unsolved up to date are exposed. © Springer Science+Business Media, LLC 2011.


Che A.,Northwestern Polytechnical University | Kats V.,Institute for Industrial Mathematics | Levner E.,Bar - Ilan University
Naval Research Logistics | Year: 2011

This study addresses cyclic scheduling in robotic flowshops with bounded work-in-process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2-cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc.

Loading Institute for Industrial Mathematics collaborators
Loading Institute for Industrial Mathematics collaborators