This paper deals with the permutation flowshop scheduling problem time lags constraints to minimize total weighted tardiness criterion by using Branch and Bound algorithm. A new lower bound was developed for problem. The computational experiments indicate that proposed algorithm provides good solution in terms of quality requirements.

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...

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, ...

Given a single machine and a set of jobs with due dates, the classical NP-hard problem of scheduling to minimize total tardiness is a well-understood one. Lawler gave an FPTAS for it some twenty years ago. If the jobs have positive weights the problem of minimizing total weighted tardiness seems to be considerably more intricate. In this paper, we give some of the first approximation algorithms...

We present a multi-agent variant of the Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times. Since, i.a., agents have an incentive to lie, central planning is not feasible and decentralized methods such as automated negotiations are needed. Hereto, we propose and evaluate an iterative quota-based negotiation protocol.

Job scheduling is concerned with the optimal allocation of scare resources with objective of optimising one or several criteria. Job scheduling has been a fruitful area of research for many decades in which scheduling resolve both allocation of machines and order of processing. If the jobs are scheduled properly, not only the time is saved but also efficiency of system is increased. The paralle...

We study the approximability of minimum total weighted tardiness with a modified objective which includes an additive constant. This ensures the existence of a positive lower bound for the minimum value. Moreover the new objective has a natural interpretation in Just-In-Time production systems.

In this paper we compare simulated annealing and tabu search approaches to a single machine common due date assignment and scheduling problem with jobs available at different times. The objective is to minimize the total weighted sum of earliness, tardiness and due date costs.