Volume 52, Number 1, January–March 2018
|Page(s)||55 - 60|
|Published online||18 April 2018|
Hierarchical optimization on an unbounded parallel-batching machine★
School of Science, Henan University of Technology,
Henan, PR China
* Corresponding author: firstname.lastname@example.org
Accepted: 30 November 2017
This paper studies a hierarchical optimization problem on an unbounded parallel-batching machine, in which two objective functions are maximum costs, representing different purposes of two decision-makers. By a hierarchical optimization problem, we mean the problem of optimizing the secondary criterion under the constraint that the primary criterion is optimized. A parallel-batching machine is a machine that can handle several jobs in a batch in which all jobs start and complete respectively at the same time. We present an O(n4)-time algorithm for this hierarchical scheduling problem.
Mathematics Subject Classification: 90B35 / 90C29
Key words: Hierarchical optimization / batching machine / maximum cost
© EDP Sciences, ROADEF, SMAI 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.