TY - JOUR

T1 - A note

T2 - Maximizing the weighted number of just-in-time jobs on a proportionate flowshop

AU - Gerstl, Enrique

AU - Mor, Baruch

AU - Mosheiov, Gur

N1 - Publisher Copyright:
© 2014 Elsevier B.V. All rights reserved.

PY - 2015/2

Y1 - 2015/2

N2 - In most cases, an extension of a polynomial time solution of a scheduling problem on a single machine to a proportionate flowshop leads to a similar (polynomial time) solution. One of the rare cases where the problem becomes hard, is that of maximizing the weighted number of Just-in-Time jobs on a proportionate flowshop. We introduce a (pseudo-polynomial) solution algorithm for this problem, which is faster by a factor of n than the algorithm published in the literature. We also introduce a (polynomial time) solution algorithm for the "no-wait" proportionate flowshop.

AB - In most cases, an extension of a polynomial time solution of a scheduling problem on a single machine to a proportionate flowshop leads to a similar (polynomial time) solution. One of the rare cases where the problem becomes hard, is that of maximizing the weighted number of Just-in-Time jobs on a proportionate flowshop. We introduce a (pseudo-polynomial) solution algorithm for this problem, which is faster by a factor of n than the algorithm published in the literature. We also introduce a (polynomial time) solution algorithm for the "no-wait" proportionate flowshop.

KW - Just-in-Time

KW - Proportionate flowshop

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=84911915061&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2014.09.004

DO - 10.1016/j.ipl.2014.09.004

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84911915061

SN - 0020-0190

VL - 115

SP - 159

EP - 162

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -