A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times

A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times

0.00 Avg rating0 Votes
Article ID: iaor20052531
Country: Netherlands
Volume: 158
Issue: 2
Start Page Number: 525
End Page Number: 528
Publication Date: Oct 2004
Journal: European Journal of Operational Research
Authors: , ,
Keywords: computational analysis
Abstract:

We consider the single machine, serial batching scheduling problem 1|prec;pj=p;s-batch;rjLmax. The complexity of this problem is reported as open in the literature. By reducing this problem to the version without precedence constraints, we show that the problem is polynomially solvable.

Reviews

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