Journal of Scheduling

This paper addresses two classes of different, yet interrelated optimization problems. The first class of problems involves a mobile searcher that must locate a hidden target in an environment that consists of a set of unbounded, concurrent rays. ...

Public transportation networks are typically operated with a periodic timetable. The periodic event scheduling problem (PESP) is the standard mathematical modeling tool for periodic timetabling. PESP is a computationally very challenging problem: ...

Motivated by the recent trend in delivering projects with value or benefit to stakeholders and seeking to reduce the significant fraction of projects plagued by schedule and budget overruns, researchers are looking at lean project management (LPM) ...

We consider a single-machine scheduling problem with multiple unavailability periods such that the processing time of each job is inversely proportional to the kth power of its own resource consumption amount. The objective is to minimize the sum ...$\mathrm{}$$\mathrm{}$

Aircraft Landing Planning is challenging because the inherently limited capacity of airport runways causes bottlenecks. This type of planning involves different stakeholders (e.g., airlines, air traffic services providers, airport authorities, and ...

Mnich and Wiese (Math Program 154:533–562, 2015) proved that the $\mathcal{NP}$-hard single-machine scheduling problem with rejection and the total weighted completion time plus total rejection cost as objective is fixed parameter tractable with respect to ...