Minimizing the number of tardy jobs on a proportionate flowshop with general position‐dependent processing times

Minimizing the number of tardy jobs on a proportionate flowshop with general position‐dependent processing times

0.00 Avg rating0 Votes
Article ID: iaor201111462
Volume: 39
Issue: 7
Start Page Number: 1601
End Page Number: 1604
Publication Date: Jul 2012
Journal: Computers and Operations Research
Authors: ,
Keywords: scheduling, combinatorial optimization
Abstract:

In various real life scheduling systems job processing times vary according to the number of jobs previously processed. The vast majority of studies assume a restrictive functional form to describe job processing times. In this note, we address a scheduling problem with the most general job processing time functions. The machine setting assumed is an m‐machine proportionate flowshop, and the objective function is minimum number of tardy jobs. We show that the problem can be formulated as a bottleneck assignment problem with a maximum cardinality constraint. An efficient polynomial time (O(n 4 log n)) solution is introduced.

Reviews

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