A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
Year of publication: |
2012
|
---|---|
Authors: | Sarin, Subhash C. ; Wang, Lixin ; Cheng, Ming |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 39.2012, 7, p. 1411-1418
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Produktionsplanung | Production planning | Branch-and-Bound | Branch and Bound |
-
Tight bounds for the identical parallel machine-scheduling problem : part II
Haouari, Mohamed, (2008)
-
Nekoiemehr, N., (2011)
-
Wang, Shijin, (2013)
- More ...
-
Should Taxable Investors Shun Dividends?
Israel, Ronen, (2019)
-
The Tax Benefits of Separating Alpha from Beta
Liberman, Joseph, (2020)
-
Should taxable investors shun dividends?
Israel, Ronen, (2019)
- More ...