Research on Common Due Date Assignment Scheduling Problem with Truncated Learning Effect

2020 ◽  
Vol 09 (03) ◽  
pp. 341-345
Author(s):  
常霖 赵
2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Oğuzhan Ahmet Arık

PurposeThis paper presents a mixed-integer programming model for a single machine earliness/tardiness scheduling problem where the objective is to minimize total earliness/tardiness duration when the uncertainty of parameters such as processing times and due date is coded with grey numbers.Design/methodology/approachGrey theory and grey numbers are used for illustrating the uncertainty of parameters in processing times and common due date, where the objective is to minimize the total earliness/tardiness duration. The paper proposes a 0–1 mathematical model for the problem and an effective heuristic method for the problem by using expected processing times for ordering jobs.FindingsThe uncertainty of the processing times and common due date are encoded with grey numbers and a position-dependent mixed-integer mathematical programming model is proposed for the problem in order to minimize total grey earliness/tardiness duration of jobs having grey processing times and a common due date. By using expected processing times for ranking grey processing times, V-shaped property of the problem and an efficient heuristic method for the problem are proposed. Solutions obtained from the heuristic method show that the heuristic is effective. The experimental study also reveals that while differences between upper and lower bounds of grey processing times decrease, the proposed heuristic's performance decreases.Originality/valueThe grey theory and grey numbers have been rarely used as machine scheduling problems. Therefore, this study provides an important contribution to the literature.


Sign in / Sign up

Export Citation Format

Share Document