Eliiyi Türsel, DenizAzizoglu, Meral2023-06-162023-06-1620100020-75431366-588Xhttps://doi.org/10.1080/00207540903289771https://hdl.handle.net/20.500.14365/1571In this study we consider the operational fixed job scheduling problem under working time limitations. The problem has several practical implications in both production and service operations; however the relevant research is scarce. We analyse pre-emptive and non pre-emptive versions of the problem and its special cases. We provide polynomial-time algorithms for some special cases. We show that the non pre-emptive jobs problem is strongly NP-hard, and propose a branch-and-bound algorithm that employs efficient bounding procedures and dominance properties. We conduct a numerical experiment to observe the effects of parameters on the quality of the solution. The results of our computational tests for the branch-and-bound algorithm reveal that our algorithm can solve the instances with up to 100 jobs in reasonable times. To the best of our knowledge our branch-and-bound algorithm is the first optimisation attempt to solve the problem.eninfo:eu-repo/semantics/closedAccessfixed job schedulingworking time constraintsbranch-and-boundApproximation AlgorithmsComputational-ComplexityArticle10.1080/002075409032897712-s2.0-77956653534