Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

in this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/i/etmax). due to the time complexity function, this sequencing problem belongs to a class of np-hard ones. thus, a special design of a simulated annealing (sa) method is applied to solve such a hard problem. to comp...

Over the last five years several websites have appeared that track the number of deaths of coalition personnel in the current Iraq conflict. This article proposes using a recently developed multiscale variance stabilization method (the datadriven Haar-Fisz transform) to obtain good estimates of the mean intensity of deaths and demonstrates its statistical advantages over both the running mean (...

In cognitive radio networks (CRNs), secondary users (SUs) may employ network coding to pursue higher throughput. However, as SUs must vacate the spectrum when it is accessed by primary users (PUs), the available transmission time of SUs is usually uncertain, i.e., SUs do not know how long the idle state can last. Meanwhile, existing network coding strategies generally adopt a block-based transm...

  In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...