On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer : minimizing the makespan and delivery cost
Year of publication: |
2015
|
---|---|
Authors: | Han, Bin ; Zhang, Wenjun ; Lu, Xiwen ; Lin, Yingzi |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 244.2015, 3 (1.8.), p. 704-714
|
Subject: | Supply chain scheduling | On-line algorithm | Delivery cost | Makespan | Lieferkette | Supply chain | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem |
-
Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs
Dumitrescu, Sorina, (2015)
-
A hybrid VNS-HS algorithm for a suppy chain scheduling problem with deteriorating jobs
Liu, Xinbao, (2018)
-
Mohammadi, S., (2020)
- More ...
-
Han, Bin, (2015)
-
Optimal on-line algorithms for one batch machine with grouped processing times
Yang, Fang, (2011)
-
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
Liu, Peihai, (2014)
- More ...