Multi-processor job shop scheduling with due windows

Author

Huang, R.H. ; Yu, S.C.

Author_Institution

Dept. of Bus. Adm., Fu Jen Catholic Univ., Taipei, Taiwan

fYear

2011

fDate

6-9 Dec. 2011

Firstpage

171

Lastpage

175

Abstract

Job shop is one of the most popular manufacturing environments in practice and is extensively discussed in literatures. Most of the literatures focus on one machine setup at each shop, which usually does not happen in practice for the purpose of workload balancing and make-span shortening. Therefore, this study aims to minimize total earliness and tardiness costs of a multi-processor job shop scheduling problem with due windows. Ant colony optimization (ACO) is deployed to solve the problem. Simulation data testing results show that ACO has similar solutions to integer programming in small scale problems, and robust, effective and time-efficient solutions in large scale problems.

Keywords

ant colony optimisation; cost reduction; integer programming; job shop scheduling; manufacturing resources planning; ant colony optimization; integer programming; machine setup; make-span shortening; manufacturing environments; multiprocessor job shop scheduling; total earliness cost minimization; total tardiness cost minimization; workload balancing; Equations; IP networks; Job shop scheduling; Mathematical model; Robustness; due windows; job shop scheduling; multi-processor;

fLanguage

English

Publisher

ieee

Conference_Titel

Industrial Engineering and Engineering Management (IEEM), 2011 IEEE International Conference on

Conference_Location

Singapore

ISSN

2157-3611

Print_ISBN

978-1-4577-0740-7

Electronic_ISBN

2157-3611

Type

conf

DOI

10.1109/IEEM.2011.6117901

Filename

6117901