𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solution of the generalized Townsend single machine scheduling model

✍ Scribed by Wlodzimierz Szwarc; Samar K. Mukhopadhyay

Book ID
103796853
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
468 KB
Volume
91
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The power of Ξ±-points in preemptive sing
The power of Ξ±-points in preemptive single machine scheduling
✍ Andreas S. Schulz; Martin Skutella πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 143 KB

We consider the NP-hard preemptive single-machine scheduling problem to minimize the total weighted completion time subject to release dates. A natural extension of Smith's ratio rule is to preempt the currently active job whenever a new job arrives that has higher ratio of weight to processing time

Solution of the single machine total tar
Solution of the single machine total tardiness problem
✍ Wlodzimierz Szwarc; Federico Della Croce; Andrea Grosso πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 129 KB πŸ‘ 2 views

The paper deals with the solution of the single machine total tardiness model. It improves and generalizes an important rule to decompose the model into two subproblems. It also provides a O(n) procedure to implement this rule and its generalization. Those two rules, along with some known results, a

Possible and necessary optimality of sol
Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters
✍ Stefan Chanas; Adam Kasperski πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 386 KB

The single machine scheduling problem with parameters given in the form of fuzzy numbers is considered. It is assumed that the optimal schedule in such a problem cannot be determined precisely (since the parameters of the problem are not known a priori). In this paper the concepts of possible and ne