Minimizing earliness and tardiness costs in a stochastic scheduling
Year of publication: |
2014
|
---|---|
Authors: | Baker, Kenneth R. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 236.2014, 2 (16.7.), p. 445-452
|
Subject: | Sequencing | Stochastic scheduling | Earliness/tardiness | Branch and bound | Neighborhood search | Due-date assignment | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Stochastischer Prozess | Stochastic process | Branch-and-Bound | Branch and Bound | Operations Research | Operations research |
-
Heuristics for the stochastic single-machine problem with E/T costs
Lemos, R. F., (2015)
-
Liu, Lei, (2024)
-
A binary branch and bound algorithm to minimize maximum scheduling cost
Chandra, Charu, (2014)
- More ...
-
Principles of sequencing and scheduling
Baker, Kenneth R., (2009)
-
Management science : the art of modeling with spreadsheets
Powell, Stephen G., (2007)
-
Optimization modeling with spreadsheets
Baker, Kenneth R., (2011)
- More ...