This paper studies the complexity of single-machine scheduling with an external resource, which is rented for a non-interrupted period. Jobs that need this resource are executed only when available. There cost associated jobs and duration renting period resource. We look at four classes problems resource: class where budgeted needs to be minimized, two-objective both, cost, linear combination m...

this study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. the problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. the time interval between consecutive maintenance activities as well as the...

We propose a mixed integer programming formulation for the single machine scheduling problem with release times and the objective of minimizing the weighted sum of the start times The basic formulation involves start time and sequence determining variables and lower bounds on the start times Its linear programming relaxation solves problems in which all release times are equal For the general p...

In this paper, we provide a new class of randomized approximation algorithms for scheduling problems by directly interpreting solutions to so-called time-indexed LPs as probabilities. The most general model we consider is scheduling unrelated parallel machines with release dates (or even network scheduling) so as to minimize the average weighted completion time. The crucial idea for these multi...

This paper presents several local search meta-heuristics for the problem of scheduling a single machine to minimise total weighted tardiness. A genetic algorithm for the static single machine total weighted tardiness problem is presented, and a multi-start version named metaGA is proposed. The obtained computational results permit to conclude about their efficiency and effectiveness. The resolu...