Abstract
In this note, we study parallel machine scheduling problem with past-sequence-dependent delivery times and a deterioration effect. We present polynomial algorithms for the problem with the total workload, the total completion time, the total absolute differences in completion times objectives.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
