Computers and Operations Research
Discrete lot sizing and scheduling using product decomposition into attributes
Computers and Operations Research
Lot-sizing and scheduling problem with earliness tardiness and setup penalties
Computers and Industrial Engineering
Fast generation of production schedules on a single machine
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
Operations Research Letters
Simultaneous batch splitting and scheduling on identical parallel production lines
Information Sciences: an International Journal
| Hi-index | 0.02 |
The discrete lotsizing and scheduling problem for one machine with sequence-dependent setup times and setup costs is solved as a single machine scheduling problem, which we term the batch sequencing problem. The relationship between the lotsizing problem and the batch sequencing problem is analyzed. The batch sequencing problem is solved with a branch & bound algorithm which is accelerated by bounding and dominance rules. The algorithm is compared with recently published procedures for solving variants of the DLSP and is found to be more efficient if the number of items is not large.