Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

Cyber sheiks and grassroots jihadis: the war in Syria and the devolution of the Bosnian Salafi communities

ABSTRACT

What was the scope of the Bosnian jihadi participation in the war in Syria? Did the Bosnian volunteers tend to join one particular faction? Why did the Bosnian youngsters decide to join the holy war in the Levant? Was this an organized and hierarchical process or was this a grassroots movement? Last, were all the Salafis in Bosnia supportive of this dynamic or did this process cause internal frictions? These are some of the questions that this research will try to answer.