Abstract
ABSTRACTThis article considers scheduling problems with resource allocation, deterioration effect and position-dependent weights on a single machine. For two different due-date assignment methods—i.e. common (CON) due-date assignment and slack (SLK) due-date assignment—a bi-criteria analysis is provided wherein the first objective is to minimize the weighted sum of the absolute value in lateness with a common due date (a common flow-allowance), and the second objective is to minimize the weighted sum of resource consumption. Optimality properties and algorithms are proposed to solve three different versions of considering these two criteria.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
