The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...

This paper considers a project scheduling problem with the objective of minimizing resource availability costs required to execute the activities in a project by a given project deadline. The project contains activities interrelated by finish-starttype precedence relations with a time lag of zero, which require a set of renewable resources. Two metaheuristics, path relinking and genetic algorit...

We consider a scheduling problem on two identical parallel machines, in which the jobs are moved between the machines by an uncapacitated transporter. In the processing preemption is allowed. The objective is to minimize the time by which all completed jobs are collected together on board the transporter. We identify the structural patterns of an optimal schedule and design an algorithm that ei...

Given a hierarchical plan (or schedule) with uncertain task times, we may need to determine the probability that a given plan will satisfy a given deadline. This problem is shown to be NPhard for series-parallel hierarchies. We provide a polynomial-time approximation algorithm for it. Computing the expected makespan of an hierarchical plan is also shown to be NP-hard. We examine the approximati...

• We schedule surgeries for surgical suites that follow parallel processing principle Parallel refers to the concurrent implementation of induction and turnover propose a two-stage stochastic mixed-integer programming model implement novel progressive hedging algorithm solve compare serial systems based on waiting time resource utilization is which enables simultaneous anesthesia operating room...