### Abstract

In this paper we will consider a one-machine batching problem which is a combination of a sequencing and a partitioning problem. We will develop an exponential neighbourhood for this problem which can be evaluated in quadratic time using shortest path calculations. Results of a computational study are reported.

Original language | Undefined |
---|---|

Place of Publication | Enschede |

Publisher | University of Twente, Department of Applied Mathematics |

Number of pages | 19 |

ISBN (Print) | 0169-2690 |

Publication status | Published - 1998 |

### Publication series

Name | Memorandum / Faculty of Mathematical Sciences, University of Twente, ISSN 0921-1969 ; no. 1449 |
---|---|

Publisher | Universiteit Twente |

No. | 1449 |

### Keywords

- EWI-3269
- METIS-141265
- IR-30624
- MSC-90B35

## Cite this

Hurink, J. L. (1998).

*An exponential neighbourhood for a one-machine batching problem*. (Memorandum / Faculty of Mathematical Sciences, University of Twente, ISSN 0921-1969 ; no. 1449; No. 1449). Enschede: University of Twente, Department of Applied Mathematics.