Abstract
Abstract A new model is formulated for sequencing n jobs on a single processor. This paper uses implicit ranking to combine three conflicting criteria in the same objective function; namely, the sequence-dependent setup cost; the inventory carrying cost; and the shortage cost. The effect of the setup time is also included. The formulation is based on the use of zero-one polynomial programming.
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
