Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Leon Y. O. Li"'
Publikováno v:
International Journal of Production Economics. 143:567-573
We consider a two-stage newsvendor model of a sub-industry in which suppliers have short lead-time capacity to produce goods for retailers that are selling non-identical products. We argue that the inventory and supply risks of the newsvendors due to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2271e658b7ec5748d9bdd2eba2f930b7
https://doi.org/10.1016/j.ijpe.2011.10.019
https://doi.org/10.1016/j.ijpe.2011.10.019
Publikováno v:
International Journal of Production Economics. 133:105-112
We propose a novel mechanism for pooling the reserved capacity (super capacity) of different supply chains, so that they can more effectively match their single-period inventory supplies with their demands. Through this mechanism, retailers can buy o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d0b4662507b8b1b2a69144bafe57972
https://doi.org/10.1016/j.ijpe.2010.12.018
https://doi.org/10.1016/j.ijpe.2010.12.018
Publikováno v:
International Journal of Production Economics. 102:132-142
It is a common practice for a multi-branch firm to have its branches ordering a group of items from a single supplier. Obviously, co-ordinating the replenishments among the branches would reduce the firm's ordering and inventory costs. In response to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09cf92d4bb8ea9da0a5789d76d2071ba
https://doi.org/10.1016/j.ijpe.2005.02.005
https://doi.org/10.1016/j.ijpe.2005.02.005
Publikováno v:
Journal of the Operational Research Society. 56:267-274
In this paper, another version of the vehicle routing problem (VRP)—the open vehicle routing problem (OVRP) is studied, in which the vehicles are not required to return to the depot, but if they do, it must be by revisiting the customers assigned t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a65e1ac2fc800016fda380a8888860e6
https://doi.org/10.1057/palgrave.jors.2601817
https://doi.org/10.1057/palgrave.jors.2601817
Autor:
Zhuo Fu, Leon Y. O. Li
Publikováno v:
Journal of the Operational Research Society. 53:552-558
This paper describes a case study of the school bus routing problem. It is formulated as a multi-objective combinatorial optimisation problem. The objectives considered include minimising the total number of buses required, the total travel time spen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f1ed9c63304430a102f766273e7d680
https://doi.org/10.1057/palgrave.jors.2601341
https://doi.org/10.1057/palgrave.jors.2601341
Publikováno v:
International Journal of Production Economics. 73:227-240
We consider a two-level supply chain with two warehouses and two retailers. Each facility uses a continuous review (R,Q)-ordering policies for stock replenishments. The retailers are identical and face independent Poisson demands. Each warehouse plac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94bd1db5ef9d050baac8b3754af4b292
https://doi.org/10.1016/s0925-5273(01)00086-x
https://doi.org/10.1016/s0925-5273(01)00086-x
Publikováno v:
BQGT
We consider a group of suppliers who have the same facilities and similar capabilities to produce goods with a very short lead-time for n retailers (newsvendors) who sell non-identical products. We treat such short lead-time capacity as a commodity t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44e4771ebc9b0a02fec2e843261a2563
https://doi.org/10.1145/1807406.1807438
https://doi.org/10.1145/1807406.1807438
The different ways of allowing time window violations lead to different types of the vehicle routing problems with soft time windows (VRPSTW). In this paper, different types of VRPSTW are analysed. A unified penalty function and a unified tabu search
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::992f476778fea076aeaf072d9e464f8c
https://doi.org/10.1057/palgrave.jors.2602371
https://doi.org/10.1057/palgrave.jors.2602371
Publikováno v:
Traffic And Transportation Studies (2002).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a1937f6c3b401dc4eea87588790109d
https://doi.org/10.1061/40630(255)68
https://doi.org/10.1061/40630(255)68
Autor:
Richard W. Eglese, Leon Y. O. Li
Publikováno v:
Meta-Heuristics ISBN: 9781461285878
The problem considered is to find the minimum cost set of routes which enable vehicles to service a set of required arcs in a network subject to the service capacity of the vehicles and a time constraint by which each arc must be serviced. The proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a59ebc783a3efb9ea38d65a3f80ad5cb
https://doi.org/10.1007/978-1-4613-1361-8_38
https://doi.org/10.1007/978-1-4613-1361-8_38