We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Population learning with differential evolution for the discrete-continuous scheduling with continuous resource discretisation

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jedrzejowicz, P. ; Dept. of Inf. Syst., Gdynia Maritime Univ., Gdynia, Poland ; Skakovski, A.

In the paper, we consider a population learning algorithm denoted (PLA3), with the differential evolution method for solving the discrete-continuous scheduling problem (DCSP) with continuous resource discretisation - Θz. The considered problem originates from DCSP, in which nonpreemtable tasks should be scheduled on parallel identical machines under constraint on discrete resource and requiring, additionally, a renewable continuous resource to minimize the schedule length. The continuous resource in DCSP is divisible continuously and is allocated to tasks from a given interval in amounts unknown in advance. Task processing rate depends on the allocated amount of the continuous resource. To eliminate time consuming optimal continuous resource allocation, an NP-hard problem Θz with continuous resource discretisation is introduced and suboptimally solved by PLA3. Experimental results show that PLA3 was able to improve best-known solutions and excels its predecessor PLA2 in solving the considered problem.

Published in:

Cybernetics (CYBCONF), 2013 IEEE International Conference on

Date of Conference:

13-15 June 2013