Volume 50, Number 1, January-March 2016
|Page(s)||211 - 219|
|Published online||02 February 2016|
A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
Erciyes University, Engineering Faculty, Industrial Engineering Department,
Accepted: 12 June 2015
This paper sheds light on minimizing the maximum tardiness with processing and setup times under both learning effect and deterioration. In this paper, all the jobs have processing and setup times under effects of learning and deterioration. By the effects of learning and deterioration, we mean that the processing time of a job is defined by an increasing function of its execution start time and position in the sequence. We provide a branch and bound algorithm to minimize the maximum tardiness under effects of learning and deterioration with setup times. Computational experiments show that the proposed algorithm can solve instances up to 800 jobs in reasonable time.
Mathematics Subject Classification: 90B35 / 90B36
Key words: Maximum tardiness problem / learning effect / deterioration effects / setup times
© EDP Sciences, ROADEF, SMAI 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.