The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 41 –
60 of
190
We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time occurs. This problem s-batch is known to be NP-Hard in the ordinary sense. In this paper we show that it is solvable in pseudopolynomial time by dynamic programming.
We study the problem of scheduling jobs on a serial batching machine
to minimize total tardiness. Jobs of the same batch start and are
completed simultaneously and the length of a batch equals the sum of
the processing times of its jobs. When a new batch starts, a constant
setup time s occurs. This problem 1|s-batch
| ∑Ti is
known to be NP-Hard in the ordinary sense. In this paper we show that
it is solvable in pseudopolynomial time by dynamic programming.
We present a modelling framework for two-stage and multi-stage mixed 0-1 problems under uncertainty for strategic Supply Chain Management, tactical production planning and operations assignment and scheduling. A scenario tree based scheme is used to represent the uncertainty. We present the Deterministic Equivalent Model of the stochastic mixed 0-1 programs with complete recourse that we study. The constraints are modelled by compact and splitting variable representations via scenarios.
A system with a single activated unit which can be in states is considered. Inspections of the system are carried out at discrete time instants. The process of deterioration of the unit is supposed to be Markovian. The unit by its operation brings an income which is monotonically dependent on its state. A replacement of the unit is associated with certain costs. The paper gives an effective algorithm for finding the replacement strategy maximizing the average income of the system per unit time....
Constructive heuristics for shop scheduling problems are often based on
priority (or dispatching) rules. However, recent work has demonstrated
that insertion algorithms that step by step insert operations or
jobs into partial schedules usually clearly outperform priority rules.
In this paper, we consider various job shop scheduling problems with
setup times. For each job a specific technological route and a release
date are given. Moreover, the jobs are partitioned into groups. A
sequence independent...
Currently displaying 41 –
60 of
190