A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem

This paper considers the problem of minimizing the total schedule changeover cost when faced with scheduling multiple products on a finite capacity resource. Several new analytical results are presented for this problem. These results are then used in developing a forward-time branch-and-search algo...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1996-06, Vol.91 (3), p.456-470
Main Authors: Blocher, James D., Chand, Suresh
Format: Article
Language:English
Subjects:
Algorithms
Changeover scheduling
Forecast horizon
Forecasting
Mathematical models
Operations research
Production capacity
Scheduling
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper considers the problem of minimizing the total schedule changeover cost when faced with scheduling multiple products on a finite capacity resource. Several new analytical results are presented for this problem. These results are then used in developing a forward-time branch-and-search algorithm and forecast horizon results for the problem. We also present computational results to investigate the effectiveness of the forecast horizon results.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(95)00074-7