Hybridizing Discrete- and Continuous-Time Models for Batch Sizing and Scheduling Problems

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Wang, Siqun, Guignard, Monique
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2006
Subjects:
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/1914
https://ink.library.smu.edu.sg/context/lkcsb_research/article/2913/viewcontent/2003paper.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.lkcsb_research-2913
record_format dspace
spelling sg-smu-ink.lkcsb_research-29132018-07-09T07:42:01Z Hybridizing Discrete- and Continuous-Time Models for Batch Sizing and Scheduling Problems Wang, Siqun Guignard, Monique 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. 2006-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/lkcsb_research/1914 info:doi/10.1016/j.cor.2004.11.013 https://ink.library.smu.edu.sg/context/lkcsb_research/article/2913/viewcontent/2003paper.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Business Administration, Management, and Operations
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Business Administration, Management, and Operations
spellingShingle Business Administration, Management, and Operations
Wang, Siqun
Guignard, Monique
Hybridizing Discrete- and Continuous-Time Models for Batch Sizing and Scheduling Problems
description 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.
format text
author Wang, Siqun
Guignard, Monique
author_facet Wang, Siqun
Guignard, Monique
author_sort Wang, Siqun
title Hybridizing Discrete- and Continuous-Time Models for Batch Sizing and Scheduling Problems
title_short Hybridizing Discrete- and Continuous-Time Models for Batch Sizing and Scheduling Problems
title_full Hybridizing Discrete- and Continuous-Time Models for Batch Sizing and Scheduling Problems
title_fullStr Hybridizing Discrete- and Continuous-Time Models for Batch Sizing and Scheduling Problems
title_full_unstemmed Hybridizing Discrete- and Continuous-Time Models for Batch Sizing and Scheduling Problems
title_sort hybridizing discrete- and continuous-time models for batch sizing and scheduling problems
publisher Institutional Knowledge at Singapore Management University
publishDate 2006
url https://ink.library.smu.edu.sg/lkcsb_research/1914
https://ink.library.smu.edu.sg/context/lkcsb_research/article/2913/viewcontent/2003paper.pdf
_version_ 1770570063742500864