The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups
In this paper, we formulate the cyclic lot scheduling problem on a single facility with sequence-dependent setup costs and times and provide a heuristic solution procedure. A Lagrangian relaxation of the formulation leads to a partial separation of the embedded lot sizing and traveling salesman prob...
| Veröffentlicht in: | Operations Research. - Institute for Operations Research and the Management Sciences, 1956. - 40(1992), 4, Seite 736-749 |
|---|---|
| 1. Verfasser: | |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
1992
|
| Zugriff auf das übergeordnete Werk: | Operations Research |
| Schlagworte: | Manufacturing, performance/productivity: cyclic lot scheduling with sequence-dependent setups Production/scheduling, sequencing, deterministic: batching with sequence-dependent setups Manufacturing, Production and Scheduling Business Behavioral sciences Economics Applied sciences Mathematics |
| Zusammenfassung: | In this paper, we formulate the cyclic lot scheduling problem on a single facility with sequence-dependent setup costs and times and provide a heuristic solution procedure. A Lagrangian relaxation of the formulation leads to a partial separation of the embedded lot sizing and traveling salesman problems. The relaxation results in a new combinatorial problem related to the minimum spanning tree problem. The information about frequency of production, gained from the solution to this relaxation, is used to find heuristic solutions for the entire problem. Computational work on randomly generated problems shows that the problem becomes more difficult as the diversity in the sequence-dependent parameters increases. |
|---|---|
| ISSN: | 15265463 |