The discrete lot-sizing and scheduling problem with sequence-dependent setup costs-Reference-Cited by-同舟云学术

The discrete lot-sizing and scheduling problem with sequence-dependent setup costs

Published:1994-06 Issue:2 Volume:75 Page:395-404
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Fleischmann Bernhard

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference17 articles.

1. Vehicle routing with time windows: Optimization and approximation;Desrochers,1988

2. A generalized permanent labeling algorithm for the shortest path problem with time windows;Desrochers;INFOR,1988

3. Lagrangean relaxation methods for solving the minimum fleet size multiple travelling salesman problem with time windows;Desrosiers;Management Science,1988

4. Solving multi-item capacitated lot-sizing problems using variable redefinition;Eppen;Operations Research,1987

5. The discrete lot-sizing and scheduling problem;Fleischmann;European Journal of Operational Research,1990

Cited by 81 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The product–mold–machine manufacturing problem: Complexity, MILP models and constructive heuristics;Computers & Industrial Engineering;2024-03

2. Multi-level lot-sizing and job shop scheduling with lot-streaming: Reformulation and solution approaches;International Journal of Production Economics;2023-09

3. Solving a Production Lot-Sizing and Scheduling Problem from an Enhanced Inventory Management Perspective;Mathematics;2023-04-28

4. Multi-Stage Multi-Product Production and Inventory Planning for Cold Rolling under Random Yield;Mathematics;2022-02-15

5. The product-mold-machine manufacturing problem;IFAC-PapersOnLine;2022