Existing models from scheduling often over-simplify the problems appearing in real-world industrial situations. The original application is often reduced to a single-objective one, where the presence of uncertainty is neglected. In this paper, we focus ...

There are different reasons, such as a preventive maintenance, for the lack of machines in the planning horizon in real industrial environments. This paper focuses on the multi-objective flexible job-shop scheduling problem with parallel machines and ...

This paper addresses the Petri net (PN) based design and modeling approach for a periodic job-shop scheduling problem. Asynchronous synthesis for net-modules of the jobs is suggested in this paper for optimal allocation of shared resources to different ...

Scheduling is a key component for performance guarantees in the case of distributed applications running in large scale heterogeneous environments. Another function of the scheduler in such system is the implementation of resilience mechanisms to cope ...

This paper studies the identical parallel machine scheduling problem with family set-up times and an objective of minimizing total weighted completion time (weighted flowtime). The family set-up time is incurred whenever there is a switch of processing ...

Scheduling and resource allocation in large scale distributed environments, such as Computational Grids (CGs), arise new requirements and challenges not considered in traditional distributed computing environments. Among these new requirements, task ...

In this paper, it is investigated how to sequence jobs with fuzzy processing times and predict their due dates on a single machine such that the total weighted possibilistic mean value of the weighted earliness-tardiness costs is minimized. First, an ...

In this paper the problem of minimizing maximum earliness on a single machine with an unavailability period (1,h"1@?E"m"a"x) and also the same problem with simultaneous minimization of the two criteria of maximum earliness and number of tardy jobs (1,h"...

The deteriorating job scheduling problems have received increasing attention recently. However, most researchers assume that the actual job processing time is a linear function of its starting time. In fact, in some situations, the deterioration rate ...

We study an on-line machine covering problem, in which jobs arrive one by one and their processing times are known upon their arrival, and jobs are allowed to migrate between machines when a new job is added in the system. However, the total processing ...

Some results in a recent paper [J.-B. Wang Single-machine scheduling with general learning functions, Computers and Mathematics with Applications 56 (2008) 1941-1947] are incorrect because job processing times are variable due to general learning ...

In this note, we show that the main results in a recent paper [M. D. Toksar, D. Oronb, E. Guner, Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning, Mathematical and Computer Modelling, 50 (2009) ...

In this paper we study a problem of sequencing jobs in a machine with programmed preventive maintenance and sequence-dependent setup times. To the authors' knowledge, this problem has not been treated as such in the operations research literature. ...

In this paper, a scheduling problem for automated guided vehicles in container terminals is defined and formulated as a Minimum Cost Flow model. This problem is then solved by a novel algorithm, NSA+, which extended the standard Network Simplex ...

Learning and job deterioration co-exist in many realistic scheduling situations. This paper introduces a general scheduling model with the effects of learning and deterioration simultaneously which is a significant generalization of some existing models ...

In this paper, we consider the problem of simultaneous determination of optimal due dates and optimal schedule for the single machine problem with multiple common due dates. The penalty for a job is assumed to be a linear function of the due date and ...

This paper studies the problem of simultaneous minimization of the two criteria of maximum earliness and number of tardy jobs on a single machine. The goal is to generate the set of efficient sequences with respect to the two criteria. A heuristic ...

In this paper we consider single-machine scheduling problems with an exponential sum-of-actual-processing-time-based learning effect. By the exponential sum-of-actual-processing-time-based learning effect, we mean that the processing time of a job is ...

In a real manufacturing system, a machine may need multiple maintenance activities to improve its production efficiency due to the effects of aging or deteriorating. This paper considers scheduling with aging or deteriorating effects and deteriorating ...