We consider single machine scheduling problems with a non-renewable resource. This type of problems has not been intensively investigated in the literature so far. For several problems of this type with standard objective functions (namely the minimization of makespan, total tardiness, number of tardy jobs, total completion time and maximum lateness), we present some complexity results. Particu...

In this paper, we consider single machine scheduling problems with a non-renewable resource. This type of problems has not been intensively investigated in the literature so far. For several problems of this type with standard objective functions (namely the minimization of makespan, total tardiness, number of tardy jobs, total completion time and maximum lateness), we present some complexity r...

In this paper we consider the single-machine setup times scheduling with general effects of deterioration and learning. By the general effects of deterioration and learning, we mean that the actual job processing time is a general function of the processing times of the jobs already processed and its scheduled position. The setup times are proportional to the length of the already processed job...

We address the no-wait k-stage flexible flowshop scheduling problem where there are m identical machines at each stage. The objectives are to schedule the available n jobs so that makespan and mean tardiness of n jobs are minimized. Sequence-dependent setup times are treated in this problem as one of the prominent practical assumptions. This problem is NP-hard, and therefore we present a new mu...

This research presents a novel approach to solve m-machine no-wait flowshop scheduling problem. A continuous flowshop problem with total flowtime as criterion is considered applying a hybrid evolutionary algorithm. The performance of the proposed method is evaluated and the results are compared with the best known in the literature. Experimental tests show the superiority of the evolutionary hy...

This paper presents a multiple time grid continuous time MILP model for the short-term scheduling of single stage, multiproduct batch plants where the objective is the minimization of total cost or total earliness. It can handle both release and due dates and it can determine the products delivery dates explicitly if these need to be considered in the objective function. This formulation is com...

This work develops a statistical model to assess the frost risk in Rafsanjan, one of the largest pistachio production regions in the world. These models can be used to estimate the probability that a frost happens in a given time-period during the year; a frost happens after 10 warm days in the growing season. These probability estimates then can be used for: (1) assessing the agroclimate risk ...

We present a new approach to implement an object bitempo-ral database where both valid-time and transaction-time are represented. It is based on the DataBase Version model, which allows an eecient management of object versions. This facilitates the manipulation of past events and allows a straightforward representation of branching evolution in valid-time.

We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomialtime algorithm to find the optimal job sequence, due date values and resource allocation minim...

The network design problem with connectivity requirements (NDC) models a wide variety of celebrated combinatorial optimization problems including the minimum spanning tree, Steiner tree, and survivable network design problems. We develop strong formulations for two versions of the edge-connectivity NDC problem: unitary problems requiring connected network designs, and nonunitary problems permit...