Abstract
We study scheduling and due-window assignment problems with the objective function of a minmax type, i.e., the goal is to minimize the largest cost among all scheduled jobs. We assume that the processing times of jobs are position-dependent in the most general way. For a single machine and for a proportionate flow shop environment we present polynomial time solution procedures that are based on solving a linear assignment problem as a subroutine. We further extend the single machine model by allowing job-rejection, provided that the processing times deteriorate, i.e., the position-dependent processing times are non-decreasing functions of the job position. For this setting, the scheduler may decide not to process certain jobs, and each rejected job is penalized accordingly. The problem with the objective that additionally involves a maximum rejection cost component is also shown to be solvable in polynomial time.
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.
