We consider a multi-period order selection problem in ̄exible manufacturing systems, which is the problem of selecting orders to be produced in each period during the upcoming planning horizon with the objective of minimising earliness and tardiness costs and subcontracting costs. The earliness and tardiness costs are incurred if an order is not ®nished on time, while subcontracting cost is incu...

A new meta-heuristic for scheduling multiple jobs on a single machine so that they are completed by a common specified date (neither earlier, nor later) is addressed in this paper. Costs are set depending on whether a job finished before (earliness), or after (tardiness) the specified due date. The objective is to minimize the total weighted earliness and tardiness penalized costs from the spec...

The current requirements of many manufacturing companies, such as the fashion, textile, and clothing industries, involve production multiple products with different processing routes short life cycles, which prevents obtaining deterministic setup times. Likewise, several industries present restrictions when changing from one reference to another in system, incurring variable sequence-dependent ...

This paper surveys the literature related to solving traditional unrelated parallel-machine scheduling problems. It compiles algorithms for the makespan, total weighted sum of completion times, maximum tardiness, total tardiness, total earliness and tardiness, and multiple criteria performance measures. The review of the existing algorithms is restricted to the deterministic problems without se...

We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example.

This study proposes an exact algorithm for the precedence-constrained singlemachine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is an extension of the authors’ previous algorithms for the problem without precedence-constraints and is based on the SSDP (Successive Sublimation Dynamic Programming) method. Numerical experime...

W e consider multimachine scheduling problems with earliness and tardiness costs. We first analyze problems in which the cost of a job is given by a general nondecreasing, convex function F of the absolute deviation of its completion time from a (common) unrestrictive duedate, and the objective is to minimize the sum of the costs incurred for all N jobs. (A special case to which considerable at...

In this paper we investigate scheduling problems with a deteriorating and resource-dependent maintenance activity on a single machine. The duration of the maintenance is assumed to be dependent both on its starting time and on the resource allocated to it. The objective is determining the job sequence, the position to perform a maintenance activity and the amount of additional resource allocate...