Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Steef van de Velde"'
Publikováno v:
4OR, 19(2), 265-288. Springer-Verlag
In this paper, we propose exact and heuristic solution approaches based on dynamic programming for an open lot streaming problem. We also present the first application of Lagrangian relaxation to compute strong lower bounds to such a problem. The app
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bfe4c3218e4d1f671155376b7002944e
https://pure.eur.nl/en/publications/a677afe8-aee8-4ddd-9da3-b3079f8e49d4
https://pure.eur.nl/en/publications/a677afe8-aee8-4ddd-9da3-b3079f8e49d4
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, 2016, pp.69-78 P
European Journal of Operational Research, 252(1), 69-78. Elsevier
European Journal of Operational Research, Elsevier, 2016, pp.69-78 P
European Journal of Operational Research, 2016, pp.69-78 P
European Journal of Operational Research, 252(1), 69-78. Elsevier
European Journal of Operational Research, Elsevier, 2016, pp.69-78 P
International audience; We consider a self-storage warehouse, facing storage orders for homogeneous or heterogeneous storage units over a certain time horizon. The warehouse operations manager needs to decide which storage orders to accept and schedu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c92f84a2d5bb431a604455da6470e919
https://hal.archives-ouvertes.fr/hal-02313355
https://hal.archives-ouvertes.fr/hal-02313355
Publikováno v:
IIE Transactions. 44:695-710
Lot streaming is a fundamental production scheduling technique to squeeze manufacturing lead times by splitting a large lot of n identical items into sublots. This article presents a full characterization of optimal solutions for two-stage lot stream
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6bb28265152de3add2d1837d1dc27070
https://doi.org/10.1080/0740817x.2011.649384
https://doi.org/10.1080/0740817x.2011.649384
Autor:
Steef van de Velde, Xiandong Zhang
Publikováno v:
European Journal of Operational Research. 216:544-552
We consider the NP -hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8437d8186d6a2646b2d00227d3f8324
https://doi.org/10.1016/j.ejor.2011.08.007
https://doi.org/10.1016/j.ejor.2011.08.007
Autor:
Steef van de Velde, F. Jordan Srour
Publikováno v:
Computers and Operations Research, 40(3), 674-690. Elsevier Ltd.
Many full truckload pick-up and delivery problems in the intermodal freight container transport industry can be modeled as Asymmetric Traveling Salesman Problems (ATSPs). Several authors have noted that while ATSPs are NP-hard, some instances are rea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9bebe27d3077a8b155b2a641d064a35f
https://pure.eur.nl/en/publications/83ceeaa7-e077-4739-ab86-5f511f3eafcc
https://pure.eur.nl/en/publications/83ceeaa7-e077-4739-ab86-5f511f3eafcc
Autor:
Steef van de Velde, Xiandong Zhang
Publikováno v:
Information Processing Letters, 100(12-13), 510-513. Elsevier
We consider the on-line two-machine job shop scheduling problem with time lags so as to minimize the makespan. Each job consists of no more than two operations and time lags exist between the completion time of the first and the start time of the sec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a658d14ba0d7f131427cfb08d4b6342f
https://doi.org/10.1016/j.ipl.2010.04.002
https://doi.org/10.1016/j.ipl.2010.04.002
Publikováno v:
Zeitschrift fur Betriebswirtschaft, 76(2), 125-138. Springer International Publishing AG
For the tendering of long-term transportation contracts in the bulk industry, shippers use bidbooks that specify for each lane the load location, the destination, the product and the volume that has to be transported over the next so many years. Bidb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e80b36f72b1b2b995773b2229e23f7a
https://doi.org/10.1007/s11573-006-0002-3
https://doi.org/10.1007/s11573-006-0002-3
Autor:
Linda van Norden, Steef van de Velde
Publikováno v:
European Journal of Operational Research, 165(1), 127-138. Elsevier
Although transportation costs can form more than 50% of the total logistics costs of a product, they are often neglected in lot-sizing research and modelling. Nonetheless, the body of research that does take transportation costs into account is gradu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3274a9db53ea2d03e769b90b597d66c9
https://doi.org/10.1016/j.ejor.2003.04.008
https://doi.org/10.1016/j.ejor.2003.04.008
Publikováno v:
California Management Review. 46:23-39
While companies spend much effort on the design, analysis, and management of their forward supply chains, they need to pay the same attention to their reverse supply chain. Pioneering firms have learned that making product returns profitable relies o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b0986cb479146aa51f861d6fb4da5f4
https://doi.org/10.2307/41166208
https://doi.org/10.2307/41166208