Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
Year of publication: |
2008
|
---|---|
Authors: | Kacem, Imed ; Chu, Chengbin ; Souissi, Ahmed |
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. 35.2008, 3, p. 827-844
|
Subject: | Produktionssystem | Manufacturing system | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Vergleich | Comparison | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming | Dynamische Optimierung | Dynamic programming | Theorie | Theory |
-
Lagrangian bounds for just-in-time job-shop scheduling
Baptiste, Philippe, (2008)
-
Neto, Teresa, (2013)
-
An empirical analysis of exact algorithms for the unbounded knapsack problem
Becker, Henrique, (2019)
- More ...
-
An improved heuristic and an exact algorithm for the 2D strip and bin packing problem
Bekrar, Abdelghani, (2010)
-
Mellouli, Racem, (2009)
-
Yu, Yugang, (2012)
- More ...