Eliiyi Türsel, DenizKorkmaz, Aslihan GizemCicek, Abdullah Ercuement2023-06-162023-06-1620092029-49132029-4921https://doi.org/10.3846/1392-8619.2009.15.245-266https://hdl.handle.net/20.500.14365/2569In this study, we consider the problem of Operational Variable Job Scheduling, also referred to as parallel machine scheduling with time windows. The problem is a more general version of the Fixed Job Scheduling problem, involving a Lime window for each job larger than its processing time. The objective is to find the optimal subset of the jobs that can be processed. An interesting application area ties in Optimal Berth Allocation, which involves the assignment of vessels arriving at the port to appropriate berths within their time windows, while maximizing the total profit from the served vessels. Eligibility constraints are also taken into consideration. We develop an integer programming model for the problem. We show that the problem is NP-hard, and develop a constraint-graph-based construction algorithm for generating near-optimal solutions. We use genetic algorithm and other improvement algorithms to enhance the solution. Computational experimentation reveals that our algorithm generates very high quality solutions in very small computation times.eninfo:eu-repo/semantics/openAccessoperational variable job schedulingeligibility constraintsoptimal berth allocationgenetic algorithmconstraint satisfactionconstraint graphBerth-Allocation ProblemParallel MachinesTime WindowsAlgorithmsModelsSystemArticle10.3846/1392-8619.2009.15.245-2662-s2.0-70949085714