This paper studies preemptive bi-criteria scheduling on m parallel machines with machine unavailable intervals. The goal is to minimize the total completion time subject to the constraint that the makespan is at most a constant T. We study the unavailability model such that the number of...

We consider a berth allocation problem in container terminals in which the assignment of vessels to berths is limited by water depth and tidal condition. We model the problem as a parallel-machine scheduling problem with inclusive processing set restrictions, where the time horizon is divided...