"Solving the discrete lotsizing and scheduling problem with sequence ..."

Marc Salomon et al. (1997)

> Home

Details and statistics

DOI: 10.1016/S0377-2217(96)00020-3

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/SalomonSWDD97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/SalomonSWDD97
Marc Salomon, Marius M. Solomon, Luk N. Van Wassenhove, Yvan Dumas, Stéphane Dauzère-Pérès:
Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows. Eur. J. Oper. Res. 100(3): 494-513 (1997)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.