An Improved Algorithm for a Bicriteria Batching Scheduling            Problem

An Improved Algorithm for a Bicriteria Batching Scheduling Problem

0.00 Avg rating0 Votes
Article ID: iaor20131877
Volume: 47
Issue: 1
Start Page Number: 1
End Page Number: 8
Publication Date: Jan 2013
Journal: RAIRO - Operations Research
Authors: , , ,
Keywords: combinatorial optimization, heuristics, decision theory: multiple criteria
Abstract:

This note is concerned with the bicriteria scheduling problem on a series‐batching machine to minimize maximum cost and makespan. An O(n 5) algorithm has been established previously. Here is an improved algorithm which solves the problem in O(n 3) time.

Reviews

Required fields are marked *. Your email address will not be published.