Abstract
Abstract The classical problem of sequencing jobs on a single processor is given a new formulation. Included in the formulation are sequence-dependent setup costs and times, inventory costs for completed jobs, and penalty costs for completion delays. The formulation results in a zero-one mixed integer linear programming problem.
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
