Research Article
A new single machine scheduling problems with dynamic arrival time and setup consideration in a common due date environment by using the Inver-over CX
@INPROCEEDINGS{10.4108/icst.bict.2014.257888, author={Shih-Hsin Chen}, title={A new single machine scheduling problems with dynamic arrival time and setup consideration in a common due date environment by using the Inver-over CX}, proceedings={8th International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)}, publisher={ICST}, proceedings_a={BICT}, year={2015}, month={2}, keywords={dynamic arrival time setup cost common due date inver-over operator}, doi={10.4108/icst.bict.2014.257888} }- Shih-Hsin Chen
Year: 2015
A new single machine scheduling problems with dynamic arrival time and setup consideration in a common due date environment by using the Inver-over CX
BICT
ACM
DOI: 10.4108/icst.bict.2014.257888
Abstract
In Rabadi et al. [9], they studied the single machine scheduling problem with setup cost in the common due date environment. Their research assumed the static state when it comes to the problem of single machine scheduling. However, in reality, the dynamic arrival time exists in the scheduling problems. It means unknown numbers of jobs arrive successively. To solve this new scheduling problems on single machine, this research will take Inver-Over [10] as the basis of Inver-over CX. The proposed algorithm combines two-point intersection PMX (Partial Message Crossover). The experimental result shows that the new method, Inver-over CX is better than Inver-over because the proposed algorithm overcomes the slow convergency of inver-over operator.