Minimizing weighted number of tardy jobs on unbounded single batching machine with family jobs

Author

Zheng, Rui ; Li, Hongyu

Author_Institution

Dept. of Manage. Sci., Fudan Univ., Shanghai, China

fYear

2009

fDate

8-11 Dec. 2009

Firstpage

1718

Lastpage

1722

Abstract

Batching machines are encountered in many different environments. The batching machine is able to process a number of jobs simultaneously as a batch. The scheduling problem to minimize weighted number of tardy jobs on a single batching machine with family jobs is proposed. The batch size is assumed to be unbounded and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. Jobs that belong to different families can not be processed in a same batch. For the problem with fixed number of m families and n jobs, a pseudopolynomial time dynamic programming algorithm is presented.

Keywords

batch processing (industrial); computational complexity; dynamic programming; scheduling; dynamic programming; family jobs; pseudopolynomial time; scheduling; tardy jobs; unbounded single batching machine; Dynamic programming; Dynamic scheduling; Environmental management; Furnaces; Heat treatment; Heuristic algorithms; Job shop scheduling; Metalworking machines; Project management; Scheduling algorithm; Scheduling; batching machine; dynamic programming algorithm; weighted number of tardy jobs;

fLanguage

English

Publisher

ieee

Conference_Titel

Industrial Engineering and Engineering Management, 2009. IEEM 2009. IEEE International Conference on

Conference_Location

Hong Kong

Print_ISBN

978-1-4244-4869-2

Electronic_ISBN

978-1-4244-4870-8

Type

conf

DOI

10.1109/IEEM.2009.5373147

Filename

5373147