Abstract
In this paper the problem of scheduling jobs in a single machine using the CON method is considered. The objective function is the total weighted lateness with different penalties, allocated to early and tardy jobs. Four algorithms are developed for the solution, examples are given and some relevant lemmas are shown.
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
