On–off minimum-time control with limited fuel usage: near global optima via linear programming

Shift to The Front II Komplek Sukamukti Banjaran Project is one of the projects implemented by one of the companies engaged in telecommunications. In its implementation, each project including Shift to The Front II Komplek Sukamukti Banjaran has a time limit specified in the contract. Project scheduling is an important role in predicting both the cost and time in a project. Every project should be able to complete the project before or just in the time specified in the contract. Delay in a project can be anticipated by accelerating the duration of completion by using the crashing method with the application of linear programming. Linear programming will help iteration in the calculation of crashing because if linear programming not used, iteration will be repeated. The objective function in this scheduling is to minimize the cost. This study aims to find a trade-off between the costs and the minimum time expected to complete this project. The acceleration of the duration of this study was carried out using the addition of 4 hours of overtime work, 3 hours of overtime work, 2 hours of overtime work, and 1 hour of overtime work. The normal time for this project is 35 days with a service fee of Rp. 52,335,690. From the results of the crashing analysis, the alternative chosen is to add 1 hour of overtime to 34 days with a total service cost of Rp. 52,375,492. This acceleration will affect the entire project because there are 33 different locations worked on Shift to The Front II and if all these locations can be accelerated then the duration of completion of the entire project will be effective

Download Full-text

Robust adaptive minimum-time control of Piecewise Affine systems

Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference ◽

10.1109/cdc.2009.5400524 ◽

2009 ◽

Cited By ~ 1

Author(s):

Michal Kvasnica ◽

Martin Herceg ◽

Lubos Cirka ◽

Miroslav Fikar

Keyword(s):

Minimum Time ◽

Piecewise Affine Systems ◽

Affine Systems ◽

Piecewise Affine ◽

Time Control ◽

Robust Adaptive

Download Full-text

Event-based minimum-time control of oscillatory neuron models

Biological Cybernetics ◽

10.1007/s00422-009-0344-3 ◽

2009 ◽

Vol 101 (5-6) ◽

pp. 387-399 ◽

Cited By ~ 42

Author(s):

Per Danzl ◽

João Hespanha ◽

Jeff Moehlis

Keyword(s):

Minimum Time ◽

Neuron Models ◽

Time Control ◽

Event Based

Download Full-text

A Digital Algorithm for Near-Minimum-Time Control of Robot Manipulators

Journal of Dynamic Systems Measurement and Control ◽

10.1115/1.3143861 ◽

1987 ◽

Vol 109 (4) ◽

pp. 320-327 ◽

Cited By ~ 5

Author(s):

C. K. Kao ◽

A. Sinha ◽

A. K. Mahalanabis

Keyword(s):

Control Algorithm ◽

State Feedback ◽

Closed Loop ◽

Robot Manipulator ◽

Minimum Time ◽

State Feedback Control ◽

Final States ◽

Closed Loop System ◽

Time Control ◽

Digital Algorithm

A digital state feedback control algorithm has been developed to obtain the near-minimum-time trajectory for the end-effector of a robot manipulator. In this algorithm, the poles of the linearized closed loop system are judiciously placed in the Z-plane to permit near-minimum-time response without violating the constraints on the actuator torques. The validity of this algorithm has been established using numerical simulations. A three-link manipulator is chosen for this purpose and the results are discussed for three different combinations of initial and final states.

Download Full-text