Abstract
In this paper, we consider a problem inspired by a real-life problem, which aims to schedule high multiplicity jobs on a single machine by taking into account the organization-specific constraints in a different schedule structure. The schedule is daily with daytime and nighttime periods. The operator is considered as an additional resource that varies in terms of consumption and scheduling depending on the period. There are specific rest periods before and after night-period jobs, and night-period jobs affect both the daily working time and number of the jobs in the daytime- period. In addition, the operator's daily workload is divided into two categories: normal and heavy. If the workload is heavy on consecutive days, specific rest periods must be scheduled. The integer programming model of the problem is presented. The feasible solutions obtained in a short time with greedy constructive heuristic algorithms are used in the exact solution approach as both upper bound and warm-start point. Finally, the effectiveness of the solution approaches is compared and evaluated through numerical experiments carried out for a variety of problem instances of different sizes.
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.
