Scheduling a set of jobs with convex piecewise linear cost functions on a single-batch-processing machine
Year of publication: |
2024
|
---|---|
Authors: | Zhang, Hongbin ; Wu, Feng |
Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 1873-5274, ZDB-ID 1491111-5. - Vol. 122.2024, Art.-No. 102958, p. 1-15
|
Subject: | Branch and bound | Convex piecewise linear cost function | Dynamic programming | Non-identical due dates | Scheduling | Theorie | Theory | Kostenfunktion | Cost function | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung |
-
An enhanced branch-and-bound algorithm for the talent scheduling problem
Qin, Hu, (2016)
-
Srirangacharyulu, B., (2013)
-
Solving multi-agent scheduling problems on parallel machines with a global objective function
Sadi, Faiza, (2014)
- More ...
-
Zhang, Hongbin, (2021)
-
Just-in-time single-batch-processing machine scheduling
Zhang, Hongbin, (2022)
-
A multi-stage financial hedging approach for the procurement of manufacturing materials
Ni, Jian, (2012)
- More ...