We consider the single-machine preemptive Pareto-scheduling problem with two competing agents A and B, where agent wants to minimize number of its jobs (the A-jobs) that is tardy, while B total late work B-jobs). provide an $$O(nn_{A}\log n_{A}+n_B\log n_B)$$ -time algorithm generates all Pareto-optimal points, $$n_A$$ A-jobs, $$n_B$$ B-jobs, $$n=n_A+n_B$$ .

Background. In preemptive job scheduling, which is a part of the flow-shop sequencing tasks, one most crucial goals to obtain schedule whose total tardiness would be minimal. Total minimization commonly reduced solving combinatorial problem becomes practically intractable as number jobs and numbers their processing periods increase. To cope with this challenge, heuristics are used. A heuristic,...

As per literature the immediate and late carpal tunnel syndrome in colles fracture and other wrist injuries is known but tardy carpal tunnel syndrome in fracture Scaphoid is rare. I am presenting a case of tardy carpal tunnel syndrome in patient with non-union fracture scaphoid with 40 years old injury.

This article deals with a quite complex machine scheduling problem comprising the following features: 1. unrelated parallel machines; 2. jobs have different due dates; 3. job splitting is allowed; 4. setup times are sequence dependent; 5. the objective function is to minimize the weighted sum of early, tardy and setup costs. The problem is formulated as a mixed-integer programming model which i...

We consider the problem of scheduling a maintenance activity and jobs on a single machine, where the maintenance activity must start before a given deadline and the maintenance duration increases with its starting time. We provide polynomial-time algorithms to solve the problems to minimize the makespan, sum of completion times, maximum lateness, and number of tardy jobs. 2014 Elsevier Ltd. All...

We consider the single-machine sequencing model with stochastic processing times and the problem of minimizing the number of stochastically tardy jobs. In general, this problem is NP-hard. Recently, however, van den Akker and Hoogeveen found some special cases that could be solved in polynomial time. We generalize their findings by providing a polynomial time solution for any stochastically ord...