An algorithm for single machine sequencing with deaslines to minimize total weighted competition time
| Year of publication: |
1983
|
|---|---|
| Authors: | Potts, C. N. ; Wassenhove, L. N. van |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 12.1983, 4, p. 379-387
|
| Subject: | Unternehmensforschung | Reihenfolgeproblem | Theorie | Theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research |
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
-
Pitombeira-Neto, Anselmo Ramalho, (2020)
- More ...
-
Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
Potts, C. N., (1988)
-
An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
Potts, C. N., (1983)
-
Crauwels, H. A. J., (1996)
- More ...