Operations, Information and Decisions Papers

Document Type

Journal Article

Date of this Version

4-2006

Publication Source

Computers & Operations Research

Volume

33

Issue

4

Start Page

971

Last Page

993

DOI

10.1016/j.cor.2004.11.013

Abstract

This paper proposes a new hybrid technique called “partial parameter uniformization” (hereafter PPU). The technique simplifies problems by ignoring the different values that certain problem parameters can take, which may facilitate the solution of some hard combinatorial optimization problems. PPU is applied to complex batch sizing and scheduling problems. Some information can be obtained from a discrete-time model in which job durations have been made uniform. This information is then exploited by a more detailed continuous-time model to generate feasible solutions and further improve these solutions. Good, or optimal solutions to the Westenberger and Kallrath Benchmark problems have been obtained in this way, at relatively low computational cost, as have solutions to the newer problems of Blömer and Günther.

Copyright/Permission Statement

© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/

Keywords

batch, machine, scheduling, integer programming, hybrid, continuous-time, discrete-time

Share

COinS
 

Date Posted: 27 November 2017

This document has been peer reviewed.