In the paper, we investigate two single processor problems, which deal with the process of negotiation between a producer and a customer about delivery time of final products. This process is modelled by a due interval, which is a generalization of well known classical due date and describes a time interval, in which a job should be finished. In this paper we consider two different mathematical...

This paper presents new elimination rules for the Single Machine Problem with general earliness and tardiness penalties subject to release dates. These rules, based on a Lagrangian decomposition, allow to drastically reduce the execution windows of the jobs. We measure the efficiency of these properties by integrating them in a Branch-and-Bound. Tests show that instances with up to 70 jobs with...

We study a scheduling problem with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the due date and schedule so as to minimize the sum of due-date, earliness and tardiness penalties. We give an O(n logn) t...

The weighted earliness tardiness parallel machine scheduling problem is NP hard. It is herein approximately solved using a decentralized multi-agent system (MAS). MAS acts as a moderator of two types of agents: free jobs, and groups of jobs assigned to machines. MAS yields good solutions’ quality in reduced run times as evidenced by the computational results. Most importantly, it can be easily ...

In the injection moulding process, a set-up containing positioning moulds, cleaning raw material hopper and machine settings is required. The uncertain owing to random factors, such as crew’s skill levels unexpected breakdowns. general version of this problem known single-machine scheduling with stochastic sequence-dependent times. specialized form problem, objective function defined so minimiz...

In practical problems, in addition to the processing time of job, impact required for delivering service customers on cost is also considered, i.e., delivery time, where job a simple linear function its starting time. This paper considers past-sequence-dependent times (which can be referred as psddt) studied objectives three types due windows (common, slack and different windows). serves minimi...

We address the single-machine stochastic scheduling problem with an objective of minimizing total expected earliness and tardiness costs, assuming that processing times follow normal distributions and due dates are decisions. We develop a branch and bound algorithm to find optimal solutions to this problem and report the results of computational experiments. We also test some heuristic procedur...