Many real-world production and service environments can be modeled using the preemptive
single machine scheduling problem with equal processing times, arbitrary release dates and …

This paper studies the scheduling of a finite set of jobs on a single machine. Jobs can be
preempted. They are associated with respective release and due dates. In a more general …

In this paper, we refine the ties within decision rules of the Total Weighted Tardiness (TWT)
heuristic from Jaramillo and Erkoc (2017) applied by the authors to solving the preemptive …

Mixed-criticality scheduling addresses the problem of sharing common resources among
jobs of different degrees of criticality and uncertain processing times. The processing time of …

We consider the problem of minimizing the weighted average execution time of equal-length
jobs performance on one machine at the specified time of job arrival and the possibility of …

Doba zpracování úlohy je jedním z nejdůležitějsích parametrů rozvrhovacích problémů,
obšem je také jedním z těch, které je velmi obtížné získat-obvykle není znám, je drahý na …

There are few technologies that hold as much promise as autonomous Cyber-physical
systems (CPS) in re-orienting the way we move around, explore new environments …

We propose a Boolean Linear Programming model for the preemptive single machine
scheduling problem with equal processing times, arbitrary release dates and weights …

This dissertation is directed at modeling, planning and scheduling MRO (Maintenance,
Repair and Overhaul) operations in aviation industry. Tactical level scheduling is designed …

This is an analysis of the problem of minimizing the total weighted completion time for jobs of
the same processing time on a single machine, given the arrival times of the jobs and the …