Algorithms for scheduling a single machine to minimize the weighted number of late jobs
Year of publication: |
1988
|
---|---|
Authors: | Potts, Chris N. |
Other Persons: | Van Wassenhove, Luk N. (contributor) |
Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : INFORMS, ISSN 0025-1909, ZDB-ID 206345-1. - Vol. 34.1988, 7, p. 843-858
|
Subject: | Produktionssteuerung | Production control | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Branch-and-Bound | Branch and Bound |
-
Ozturk, Onur, (2017)
-
Makespan minimization on a two-machine flowshop with an availability constraint on the first machine
Hnaien, Faicel, (2015)
-
Lee, Ju-Yong, (2015)
- More ...
-
Single machine scheduling to minimize total weighted late work
Hariri, A. M., (1992)
-
Integrating scheduling with batching and lot-sizing : a review of algorithms and complexity
Van Wassenhove, Luk N., (1991)
-
Approximation algorithms for scheduling a single machine to ninimize total late work
Potts, Chris N., (1991)
- More ...