The complexity of short schedules for uet bipartite graphs
The complexity of short schedules for uet bipartite graphs
We show that the problem of deciding if there is a schedule of length three for the multiprocessor scheduling problem on identical machines and unit execution time tasks in -complete even for bipartite graphs, i.e. for precedence graphs of depth one. This complexity result extends a classical result of Lenstra and Rinnoy Kan [5].
The determination of direct control algorithms activation moments using a real-time scheduling algorithm
The determination of surgical suite capacity and an evaluation of patient scheduling policies
The disjoint cliques problem
The Operational Flight and Multi-Crew Scheduling Problem
Timed Petri-net based formulation and an algorithm for the optimal scheduling of batch plants
The effective scheduling of operations in batch plants has a great potential for high economic returns, in which the formulation and an optimal solution algorithm are the main issues of study. Petri nets have proven to be a promising technique for solving many difficult problems associated with the modelling, formal analysis, design and coordination control of discrete-event systems. One of the major advantages of using a Petri-net model is that the same model can be used for the analysis of behavioural...
Two Machine Scheduling Problem when Passing Allowed.
Two-point approximations for activity times in PERT networks