In this article, we consider the minimization of the total tardiness in a flexible job-shop. In our knowledge, this criterion is not previously studied for this type of shop configuration. The total tardiness criterion was mainly considered in the single machine problem (Chu [Chu92] and Souissi et al. [SKC04]). Few references studied this criterion in a job-shop configuration. The priority rule...

Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent constraints among requests. Associated with each workflow is a deadline that defines the time by which all computations of a workflow should be complete. Workflows are submitted by numerous clients to a scheduler that ...

Scheduling problems involving both earliness and tardiness costs became more important in recent years. This kind of problems include both earliness and tardiness penalties and tries to reduce them. In this study a case study from real world is investigated. Since the machine is bottle neck in the production line and all jobs have a common restrictive due date and different earliness and tardin...

The objective of this paper is to propose a scheduling problem for multiple automated guided vehicles (AGVs) in a manufacturing system. Considering the due date of AGVs requiring for material handling among shops in a job shop layout, their earliness and tardiness are significant in satisfying the expected cycle time and from an economic view point. Earliness results in AGVs waiting and tardine...

Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

This paper considers a stochastic assembly system operating on a make-to-order basis with complex product structure and resource constraints. The problem is to ® nd the optimal planned job release times by minimizing the expected sum of the work-in-progress holding cost, product earliness cost and product tardiness cost. A perturbation analysis algorithm is developed to derive the gradient esti...

Two optimal algorithms, MTA* and MT-RBA*, are presented to find the optimal yard crane (YC) job sequence for serving a fleet of vehicles for delivery and pickup jobs with scheduled deadlines and predicted vehicle arrival times. The objective is to minimize the total tardiness of incoming vehicle jobs. This is important for minimizing vessel turnaround time. In the search for an optimal job sequ...

In this paper, we propose n-jobs to be processed on Single Machine Scheduling Problem (SMSP) involving fuzzy processing time and fuzzy due dates. The different due dates for each job be considered which meet the demand of customer with more satisfaction level. The main objective of this paper is the total penalty cost to be minimum in the schedule of the jobs on the single machine. This cost is...

In enterprise management, there are often multiple agents competing for the same products to reduce production cost. On this basis, paper investigates a two-agent slack due-date single-machine scheduling problem with deteriorating jobs, where processing time of job is extended as function position-dependent workload, resource allocation and common deterioration rate. The goal find optimal seque...