We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...

We study the problem of QoS guarantee for di erentiated services. A two-level hierarchical scheduling framework is deployed for the separation of the QoS metrics. Due to the desirable property of minimizing the maximum packet lateness, the Earliest Deadline First (EDF) scheduling is adopted to provide the in-class scheduling for the time-sensitive traÆc. We propose to employ an EDF scheduler co...

In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at the problem with only one resource. We show how to adapt the procedure by Van den Akker et al. [1] for the problem of minimizing maximum lateness on a set of identical, parallel machines such that it can be used to solv...

We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...

We consider single machine scheduling problems with additional non-renewable resource constraints. Examples for resources include raw materials, energy, or money. Usually they have an initial stock and replenishments arrive over time at a-priori known points quantities. The jobs some requirements from the a job can only be started if available quantity each of required exceeds job. Upon startin...

We study the problem of scheduling jobs with release times and due-dates on a single machine with the objective to minimize the maximal job lateness. This problem is strongly NP-hard, however it is known to be polynomially solvable for the case when the processing times of some jobs are restricted to either p or 2p, for some integer p. We present a polynomial-time algorithm when job processing ...

We present a novel model for due date quotation. Jobs arrive at a single server or m-machine flow shop over time. Upon arrival, the processing times on each machine of the job are known, and due dates must be quoted for each job. The jobs are sequenced on the machines without preemption. Associated with each job, there are three measures of disadvantages to the inventory cost and the service le...

Email: [email protected] Email: marco. [email protected] Email: [email protected] phone: ++49-371-531 42 52 In order to compare the reached solution quality, we used the mean ow time and the mean lateness of jobs. For the comparison of the results achieved by the means of the Ant Algorithm and other methods we used a priority rule scheduler (PRI...

The handling of containers in port logistics consists of several activities, such as discharging, loading, gate-in and gate-out, among others. These activities are carried out using various equipment including quay cranes, yard cranes, trucks, and other related machinery. The high inter-dependency among activities and equipment on various factors often puts successive activities off schedule in...

The two-dimensional non-oriented bin packing problem with due dates packs a set of rectangular items, which may be rotated by 90 degrees, into identical rectangular bins. The bins have equal processing times. An item’s lateness is the difference between its due date and the completion time of its bin. The problem packs all items without overlap as to minimize maximum lateness Lmax. The paper pr...