Minimizing total weighted completion time on a batch-processing machine with re-entrance

The single batch-processing machine scheduling problem with re-entrance to minimize total weighted completion time is considered, where the capacity of the machine is infinite and there are different processing types in the same machine. This problem can be transformed into a model with parallel cha...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE International Conference on Automation and Logistics pp. 1791 - 1794
Main Authors Rui Zheng, Hongyu Li
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2009
Subjects
Automation
batch-processing
Billets
chains precedence constraints
Circuit testing
Conference management
Heat treatment
heuristic algorithm
Heuristic algorithms
Job shop scheduling
Logistics
Polynomials
Project management
re-entrance
Scheduling
Online AccessGet full text
ISBN9781424447947
1424447941
ISSN2161-8151
DOI10.1109/ICAL.2009.5262674

Cover

More Information
Summary:The single batch-processing machine scheduling problem with re-entrance to minimize total weighted completion time is considered, where the capacity of the machine is infinite and there are different processing types in the same machine. This problem can be transformed into a model with parallel chains precedence constraint. A polynomial time heuristic algorithm for the problem is given. Experimentation results show that the algorithm is efficient.
ISBN:9781424447947
1424447941
ISSN:2161-8151
DOI:10.1109/ICAL.2009.5262674