Advanced Search
Article Contents
Article Contents

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

Abstract Related Papers Cited by
  • 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.
    Mathematics Subject Classification: Primary: 58F15, 58F17; Secondary: 53C35.


    \begin{equation} \\ \end{equation}
  • 加载中

Article Metrics

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

Access History

Other Articles By Authors



    DownLoad:  Full-Size Img  PowerPoint