An Improved Algorithm for a Bicriteria Batching Scheduling Problem

An Improved Algorithm for a Bicriteria Batching Scheduling Problem

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:R.A.I.R.O. Recherche opérationnelle 2013-01, Vol.47 (1), p.1-8
Hauptverfasser: He, Cheng, Wang, Xiumei, Lin, Yixun, Mu, Yundong
Format: Artikel
Sprache:eng
Schlagworte:
68Q25
90B35
90B50
Algorithms
Analysis
Batch processes
batching machine
maximum Cost
Multicriteria scheduling
pareto optimal solutions
Scheduling
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0399-0559
1290-3868
DOI:10.1051/ro/2012023