The paper describes an optimization procedure for a class of discrete optimization problems which is defined by certain properties of the boundary of the feasible region and level sets of the objective function. It is shown ...
The paper describes an optimization procedure for a class of discrete optimization problems which is defined by certain properties of the boundary of the feasible region and level sets of the objective function. It is shown ...
The objective of measuring leaf photosynthesis using infrared gas analysis is to determine key indicators of plant eco-physiology, including light and CO2 compensation and saturation points, and critical thresholds of ...
Hybrid flow-shop problems and problems with multiprocessor task systems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop ...
The paper presents a priority algorithm for the maximum lateness problem with parallel identical processors, presedence constraints, and preemptions. The presented algorithm calculates the priority of each task by constructing ...
Zinder, Yakov(Western Australian Centre of Excellence in Industrial Optimisation, Curtin University of Technology, 2005)
The paper is concerned with the problem of shceduling a partially ordered set of unit execution time tasks on parallel identical machines in ordered to minimise the criterion of maximum lateness which plays one of the ...
Two extensions of the classical scheduling model with two parallel identical machines and a partially ordered set of unit execution time tasks are considered. It is well known that the Coffman-Graham algorithm constructs ...
Zinder, Yakov; Singh, Gaurav; Su, Bo Liang Tim; Sorli, Ronald(Universal Academy Press Inc, 2007)
The paper is concerned iwth the problem of scheduling partially ordered unit execution time tasks on parallel processors with unit communication delays and release times. Two criteria are considered the maximum lateness ...
When considering the NP-hard problem of scheduling precedence constrained tasks with preemptions on identical parallel machines with the goal of minimising the maximum lateness, approximation algorithms are commonly studied. ...