A solution framework for scheduling a BPM with non-identical job dimensions

M. Ramasubramaniam; M. Mathirajan

doi:10.3934/jimo.2007.3.445

Article Contents

2007, Volume 3, Issue 3: 445-456. Doi: 10.3934/jimo.2007.3.445

This issue Previous Article Learning algorithms for finite horizon constrained Markov decision processes Next Article Revenue management via multi-product available to promise

A solution framework for scheduling a BPM with non-identical job dimensions

M. Ramasubramaniam^1, and
M. Mathirajan²

1.
Corresponding author, Department of Management Studies, Indian Institute of Science, Bangalore-560012
2.
Department of Management Studies, Indian Institute of Science, Bangalore-560012

Received: February 28, 2006

Revised: April 30, 2007

Published: June 2007

Abstract Related Papers Cited by

Abstract

This paper considers the problem of scheduling a single job family, where each job has non-identical job-sizes, non-identical job-dimensions and a furnace (a batch processing machine) that can process up to $B (B < n)$ jobs as a batch simultaneously. The motivation for this problem is the heat-treatment operation in the post casting stage of steel casting manufacturing. We propose (0-1) integer non-linear programming for minimizing the completion time of the last job, makespan. We also propose heuristic and a simple computational analysis which indicates heuristic algorithm has very good solution quality.

Keywords:

Mathematics Subject Classification: Primary: 58F15, 58F17; Secondary: 53C35.

Citation:

Article Metrics

HTML views() PDF downloads(121) Cited by(0)

A solution framework for scheduling a BPM with non-identical job dimensions

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

A solution framework for scheduling a BPM with non-identical job dimensions

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content