Abstract
In this paper, the single-machine scheduling problem is studied by simultaneously considering due-date assignment and group technology (GT). The objective is to determine the optimal sequence of groups and jobs within groups and optimal due-date assignment to minimize the weighted sum of the absolute value in lateness and due-date assignment cost, where the weights are position dependent. For the common (CON) due-date assignment, slack (SLK) due-date assignment, and different (DIF) due-date assignment, an O n log n time algorithm is proposed, respectively, to solve the problem, where n is the number of jobs.
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.
