WENO schemes with Lax–Wendroff type time discretizations for Hamilton–Jacobi equations

In this paper, a class of weighted essentially non-oscillatory (WENO) schemes with a Lax–Wendroff time discretization procedure, termed WENO-LW schemes, for solving Hamilton–Jacobi equations is presented. This is an alternative method for time discretization to the popular total variation diminishing (TVD) Runge–Kutta time discretizations. We explore the possibility in avoiding the nonlinear weights for part of the procedure, hence reducing the cost but still maintaining non-oscillatory properties for problems with strong discontinuous derivative. As a result, comparing with the original WENO with Runge–Kutta time discretizations schemes (WENO-RK) of Jiang and Peng [G. Jiang, D. Peng, Weighted ENO schemes for Hamilton–Jacobi equations, SIAM J. Sci. Comput. 21 (2000) 2126–2143] for Hamilton–Jacobi equations, the major advantages of WENO-LW schemes are more cost effective for certain problems and their compactness in the reconstruction. Extensive numerical experiments are performed to illustrate the capability of the method.     

Exact solutions with compact and noncompact structures for the one-dimensional generalized Benjamin–Bona–Mahony equation

This paper is devoted to analyzing the physical structures of nonlinear dispersive variants of the Benjamin–Bona–Mahony equation. It is found that these generalized forms give rise to compactons solutions: solitons with the absence of infinite tails, solitons: nonlinear localized waves of infinite support, solitary patterns solutions having infinite slopes or cusps, and plane periodic solutions. It is also found that the qualitative change in the physical structure of solutions depends strongly on whether the exponents of the wave function u(x, t) whether it is positive or negative, and on the speed c of the traveling wave as well.     

Long time behaviour for generalized complex Ginzburg–Landau equation

In this paper, the two-dimensional generalized complex Ginzburg–Landau equation (CGL)

u_t=ρu−Δφ(u)−(1+iγ)Δu−νΔ²u−(1+iμ)|u|^2σu+αλ₁(|u|²u)+β(λ₂)|u|²

is studied. The existence of global attractor for this equation with periodic boundary condition is established and upper bounds of Hausdorff and fractal dimensions of attractor are obtained.     

Extremes of space–time Gaussian processes

Let Z={_Zt(h);h∈R^d,t∈R}$Z=\{Z_t\left(h\right);h\in {\mathbb{R}}^d,t\in \mathbb{R}\}$ be a space–time Gaussian process which is stationary in the time variable t$t$. We study _Mn(h)=_{supt∈[0,n]Zt}(_snh)$M_n\left(h\right)={sup}_{t\in [0,n]}{Z}_t\left(s_{n}h\right)$, the supremum of Z$Z$ taken over t∈[0,n]$t\in [0,n]$ and rescaled by a properly chosen sequence _sn→0$s_n\to 0$. Under appropriate conditions on Z$Z$, we show that for some normalizing sequence _bn→∞$b_n\to \infty$, the process _bn(_Mn−_bn)$b_n(M_n-b_n)$ converges as n→∞$n\to \infty$ to a stationary max-stable process of Brown–Resnick type. Using strong approximation, we derive an analogous result for the empirical process.     

Minmax scheduling with job-classes and earliness–tardiness costs

We address scheduling problems with job-dependent due-dates and general (possibly nonlinear and asymmetric) earliness and tardiness costs. The number of distinct due-dates is substantially smaller than the number of jobs, thus jobs are partitioned to classes, where all jobs of a given class share a common due-date. We consider the settings of a single machine and parallel identical machines. Our objective is of a minmax type, i.e., we seek a schedule that minimizes the maximum earliness/tardiness cost among all jobs.     

Due-window assignment with identical jobs on parallel uniform machines

A scheduling problem with a common due-window, earliness and tardiness costs, and identical processing time jobs is studied. We focus on the setting of both (i) job-dependent earliness/tardiness job weights and (ii) parallel uniform machines. The objective is to find the job allocation to the machines and the job schedule, such that the total weighted earliness and tardiness cost is minimized. We study both cases of a non-restrictive (i.e. sufficiently late), and a restrictive due-window. For a given number of machines, the solutions of the problems studied here are obtained in polynomial time in the number of jobs.     

A sequential exchange approach for minimizing earliness–tardiness penalties of single-machine scheduling with a common due date

This study focuses on a class of single-machine scheduling problems with a common due date where the objective is to minimize the total earliness–tardiness penalty for the jobs. A sequential exchange approach utilizing a job exchange procedure and three previously established properties in common due date scheduling was developed and tested with a set of benchmark problems. The developed approach generates results better than not only those of the existing dedicated heuristics but also in many cases those of meta-heuristic approaches. And the developed approach performs consistently well in various job settings with respect to the number of jobs, processing time and earliness–tardiness penalties for the jobs.     

Due dates assignment and JIT scheduling with equal-size jobs

This paper deals with due date assignment and just-in-time scheduling for single machine and parallel machine problems with equal-size jobs where the objective is to minimize the total weighted earliness–tardiness and due date cost. These two problems, but with a common due date to be calculated, were shown to be polynomially solvable in O(n⁴)$O(n^4)$ time. We first show that this complexity can be reduced to O(n³)$O(n^3)$ by modeling the single machine scheduling problem as an assignment problem without necessary due date enumeration. We next prove that the general case with identical parallel machines and a given set of assignable due dates where the cardinality of this set is bounded by a constant number is still polynomially solvable.     

Scheduling jobs on parallel machines with sequence-dependent setup times

Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the weighted tardinesses. In the first phase, as a pre-processing procedure, factors or statistics which characterize an instance are computed. The second phase consists of constructing a sequence by a dispatching rule which is controlled through parameters determined by the factors. In the third phase, as a post-processing procedure, a simulated annealing method is applied starting from a seed solution which is the result of the second phase. In the dispatching rule of the second phase there are two parameters of which the values are dependent on the particular problem instance at hand. Through extensive experiments rules are developed for determining the values of the two parameters which make the priority rule work effectively. The performance of the simulated annealing procedure in the third phase is evaluated for various values of the factors.     

Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness

We consider the problem of scheduling n preemptive jobs on a single machine to minimize total tardiness, subject to agreeable due dates, i.e., a later release date corresponds to a later due date. We prove that the problem is -hard in the ordinary sense by showing that it is -hard, and deriving a pseudo-polynomial algorithm for it.     

Minimizing the number of machines for scheduling jobs with equal processing times

In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a feasible schedule in such a way that the maximal number of simultaneously used machines is minimal. We give a polynomial algorithm for this problem.     

Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs

This paper studies the parallel machines bi-criteria scheduling problem (PMBSP) in a deteriorating system. Sequencing and scheduling problems (SSP) have seldom considered the two phenomena concurrently. This paper discusses the parallel machines scheduling problem with the effects of machine and job deterioration. By the machine deterioration effect, we mean that each machine deteriorates at a different rate. This deterioration is considered in terms of cost which depends on the production rate, the machine’s operating characteristics and the kind of work done by each machine. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizing total tardiness and machine deteriorating cost. The problem of total tardiness on identical parallel machines is NP-hard, thus the problem with machine deteriorating cost as an additional term is also NP-hard. We propose the LP-metric method to show the importance of our proposed multi-objective problem. A metaheuristic algorithm is developed to locate optimal or near optimal solutions based on a Tabu search mechanism. Numerical examples are presented to show the efficiency of this model.     

Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes

This paper considers the scheduling problem of parallel batch processing machines with non-identical job sizes. The jobs are processed in batches and the machines have the same capacity. The models of minimizing makespan and total completion time are given using mixed integer programming method and the computational complexity is analyzed. The bound on the number of feasible solutions is given and the properties of the optimal solutions are presented. Then a polynomial time algorithm is proposed and the worst case ratios for minimizing total completion time and makespan is proved to be 2 and (8/3–2/3 m) respectively. To test the proposed algorithm, we generate different levels of random instances. The computational results demonstrate the effectiveness of the algorithm for minimizing the two objectives.     

Scheduling jobs with release dates on parallel batch processing machines

In this paper we consider the problem of scheduling jobs with release dates on parallel unbounded batch processing machines to minimize the maximum lateness. We show that the case where the jobs have deadlines is strongly NP-hard. We develop a polynomial-time approximation scheme for the problem to minimize the maximum delivery completion time, which is equivalent to minimizing the maximum lateness from the optimization viewpoint.     

Integrated machine scheduling and vehicle routing with time windows

This paper integrates production and outbound distribution scheduling in order to minimize total tardiness. The overall problem consists of two subproblems. The first addresses scheduling a set of jobs on parallel machines with machine-dependent ready times. The second focusses on the delivery of completed jobs with a fleet of vehicles which may differ in their loading capacities and ready times. Job-dependent processing times, delivery time windows, service times, and destinations are taken into account. A genetic algorithm approach is introduced to solve the integrated problem as a whole. Two main questions are examined. Are the results of integrating machine scheduling and vehicle routing significantly better than those of classic decomposition approaches which break down the overall problem, solve the two subproblems successively, and merge the subsolutions to form a solution to the overall problem? And if so, is it possible to capitalize on these potentials despite the complexity of the integrated problem? Both questions are tackled by means of a numerical study. The genetic algorithm outperforms the classic decomposition approaches in case of small-size instances and is able to generate relatively good solutions for instances with up to 50 jobs, 5 machines, and 10 vehicles.     

Minimizing total completion time for UET tasks with release time and outtree precedence constraints

Brucker et al. (Math Methods Oper Res 56: 407–412, 2003) have given an O(n ²)-time algorithm for the problems , outtree and , outtree . In this note, we show that their algorithm admits an O(n log n)-time implementation.     

Large time behavior of solutions of Hamilton–Jacobi equations with periodic boundary data

We study the large time behavior of viscosity solutions of Hamilton–Jacobi equations with periodic boundary data on bounded domains. We establish a result on convergence of viscosity solutions to state constraint asymptotic solutions or periodic asymptotic solutions depending on the sign of critical value as time goes to infinity.     

Absolutely continuous Hardy–Sobolev functions in the unit disc

Let f(z) be an analytic function defined in the unit disc whose fractional derivative of order belongs to H^p, 0<p1. We show that as a consequence of a monotonicity condition on the decay of the Taylor coefficients, it is possible to improve the usual radial boundary growth estimate for H^p functions by a logarithmic factor. As a consequence we show that under certain regularity conditions imposed on the decay and oscillations of the absolute values of the function's Taylor coefficients, it is possible to estimate the function's modulus of continuity and modulus of absolute continuity and that a consequence of this is that as p→0, these functions will be generally smoother. Examples are also given of Hardy–Sobolev functions having modulus of absolute continuity different than modulus of continuity.     

On-line integrated production–distribution scheduling problems with capacitated deliveries

In on-line integrated production–distribution problems, customers release jobs to a manufacturer that has to process the jobs and deliver them to the customers. The jobs are released on-line, that is, at any time there is no information about future jobs. Processed jobs are grouped into batches, which are delivered to the customers as single shipments. The total cost (to be minimized) is the sum of the total weighted flow time and the total delivery cost. Such on-line integrated production–distribution problems have been studied for the case of uncapacitated batches. We consider the capacitated case with an upper bound on the size of a batch. For several versions of the problem, we present efficient on-line algorithms, and use competitive analysis to study their worst-case performance.     

Traveling fronts in space–time periodic media

This paper is concerned with the existence of pulsating traveling fronts for the equation:

(1)

∂_tu−(A(t,x)u)+q(t,x)u=f(t,x,u),