In this note we provide new complexity and algorithmic results for scheduling inventory releasing jobs, a new class of single machine scheduling problems proposed recently by Boysen et al. We focus on tardiness related criteria, while known results are concerned with inventory levels between fixed delivery points. Our interest is motivated by the fact that deciding whether a feasible schedule e...

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

In this paper, we consider the single machine earliness/tardiness scheduling problem with di/erent release dates and no unforced idle time. The problem is decomposed into weighted earliness and weighted tardiness subproblems. Lower bounding procedures are proposed for each of these subproblems, and the lower bound for the original problem is the sum of the lower bounds for the two subproblems. ...

0377-2217/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.ejor.2011.10.020 ⇑ Corresponding author. Tel.: +43 732 2468 9466. E-mail address: [email protected] (R. Braune). In this paper, we propose an exact solution method for single machine scheduling problems typically arising from bottleneck-based decomposition of weighted tardiness job shops. The encountered subproblems are characte...

This paper presents a simulation analysis on the effects of robust master production scheduling. Up to now, relatively highly aggregated planning models for robust master production scheduling were regarded and the realizability of the planning results was not considered. This paper analyses a more detailed model for master production scheduling than in previous works. The evaluation of the pla...

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

In this paper we consider the single-machine setup times scheduling with general effects of deterioration and learning. By the general effects of deterioration and learning, we mean that the actual job processing time is a general function of the processing times of the jobs already processed and its scheduled position. The setup times are proportional to the length of the already processed job...

While it is imperative that all time constraints are met in hard real-time systems, firm or soft real-time systems do not have as stringent timeliness requirements, allowing for some degree of tardiness (soft) or miss ratio (firm). A significant body of research within the soft and firm real-time area has focused on minimizing tardiness and/or miss ratio, but without quantifying acceptable leve...

We study the scheduling situation in which a set of jobs subjected to release dates and deadlines are to be performed on a single machine. The objective is to minimize a piecewise linear objective function ∑ j Fj where Fj(Cj) corresponds to the cost of the completion of job j at time Cj . This class of function is very large and thus interesting both from a theoretical and practical point of vi...