Abstract
We study a due-window assignment problem on parallel identical machines, with unit processing time jobs. The objective function is minimum total cost, consisting of earliness, tardiness, due-window starting time and due-window size. A recent paper (Janiak et al., 2012) introduced a solution algorithm requiring O(n5/m2) time, where n is the number of jobs, and m is the number of machines. We propose a significantly faster procedure, requiring O(n3) only.
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.
