| Issue |
RAIRO-Oper. Res.
Volume 47, Number 1, January-March 2013
|
|
|---|---|---|
| Page(s) | 1 - 8 | |
| DOI | https://doi.org/10.1051/ro/2012023 | |
| Published online | 11 February 2013 | |
An Improved Algorithm for a Bicriteria Batching Scheduling Problem∗
1 School of Science, Henan University
of Technology, Zhengzhou, Henan
450001,
China.
hech202@163.com
2 Department of Mathematics, Zhengzhou
University, Zhengzhou, Henan
450001,
China
Received:
10
March
2012
Accepted:
26
November
2012
This note is concerned with the bicriteria scheduling problem on a series-batching machine to minimize maximum cost and makespan. An O(n5) algorithm has been established previously. Here is an improved algorithm which solves the problem in O(n3) time.
Mathematics Subject Classification: 68Q25 / 90B35 / 90B50
Key words: Multicriteria scheduling / batching machine / maximum Cost / pareto optimal solutions
© EDP Sciences, ROADEF, SMAI, 2013
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.